1015:Jury Compromise

解法1. Time Limit Exceeded
dfs, 超时，但也是一种思路。

//dfs
#include <iostream>
#include <cmath>
using namespace std;

const int maxn = 201;
int d[maxn], p[maxn],ans[21];
int pNum, dNum;//p,d各自的总和
int n, m;
//tp,td,tans表示当前结果
void dfs(int tp, int td, int current, int start, int* tans) {
	if (current == m) {//递归出口
		//最优解的判断条件
		if ((abs(td - tp) < abs(pNum - dNum)) ||
			(abs(td - tp) == abs(pNum - dNum) && (td + tp) > (pNum + dNum))) {
			pNum = tp;
			dNum = td;
			for (int i = 1; i <= m; i++) {
				ans[i] = tans[i];
			}
			return;
		}
		else {
			return;
		}
	}
	if (m - current > n - start) {//剪枝：剩余人员不足
		return;
	}
	for (int i = start + 1; i <= n; i++) {//后续遍历
		tans[current + 1] = i;
		dfs(tp + p[i], td + d[i], current + 1, i, tans);
	}
	return;
}

void calc() {
	pNum = 201, dNum = -201;
	int tans[21];
	for (int i = 1; i <= n; i++) {//遍历，以第i名成员作为第一个
		tans[1] = i;
		dfs(p[i], d[i], 1, i, tans);
	}
}

int main() {
	int cnt=0;//测试用例序号
	while (cin >> n >> m) {
		if (n == 0 && m == 0) break;
		cnt++;
		for (int i = 1; i <= n; i++) {
			cin >> p[i] >> d[i];
		}

		calc();//计算

		printf("Jury #%d\n", cnt);
		printf("Best jury has value %d for prosecution and value %d for defence: \n", pNum, dNum);
		for (int i = 1; i <= m; i++) {
			cout << " " << ans[i];
		}
		cout << endl;
	}
	return 0;
}