#include<cstdio>#include<algorithm>
using namespace std;#define n 4#define max(a, b) (a) > (b) ? (a) : (b)struct it {int w, v;};
it goods[n +1];intmain(){//input int c[n][n]={//代价矩阵, c[0][2]表示第一个人完成第三个任务所花费的代价 {9,2,7,8},{6,4,3,7},{5,8,1,8},{7,6,9,4}};int a[n]={0,1,2,3};int minv =1<<29;do{int people =0;int value =0;for(int i =0; i < n; i++){// printf("%d ", a[i]);
value += c[people++][a[i]];}// printf("%d\n", value);
minv =min(minv, value);}while(next_permutation(a, a + n));//排列组合 //outputprintf("%d", minv);return0;}