题解:
模型:01背包问题
定义f[i][j][k]:i为前i个人,j为在前i个人中选了j个人,k为总的差值(因为k在数组内需要>=0,其实际范围是-400到400,所以k有400的偏移),f[i][j][k]则表示当前的最大和。
f[i,j,k] = max(f[i-1,j,k], f[i-1,j-1,k-(Pi-Di)] + Pi+Di )
dp之后寻找最小k(400对应最小,从400向两端搜索)及其对应的和,然后倒序遍历找出所有被选中的人,存下编号,记录所求值,排序输出。
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
#define N 2100005
#define PII pair<int,int>
#define inf 0x3f3f3f3f
#define ll long long
const double eps = 1e-6;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define mod 2147483648
int f[210][21][805];
int base = 400;
int n, m, p[210], d[210], ans[210];
int main() {
int T = 1;
while (scanf("%d %d", &n, &m), n || m) {
for (int i = 1; i <= n; i++)
cin >> p[i] >> d[i];
memset(f, -0x3f, sizeof f);
f[0][0][base] = 0;
for(int i=1;i<=n;i++)
for(int j=0;j<=m;j++)
for (int k = 0; k < 805; k++)
{
f[i][j][k] = f[i - 1][j][k];
int t = k - (p[i] - d[i]);
if (t < 0 || t >= 805) continue;
if (j < 1) continue;
f[i][j][k] = max(f[i][j][k], f[i-1][j-1][t]+p[i]+d[i]);
}
int v = 0;
while (f[n][m][base + v] < 0 && f[n][m][base - v] < 0) v++;
if (f[n][m][base + v] > f[n][m][base - v]) v = base + v;
else v = base - v;
int i = n, j = m, k = v,cnt=0;
while (j)
{
if (f[i][j][k] == f[i - 1][j][k]) i--;
else
{
ans[cnt++] = i;
k -= (p[i] - d[i]);
i--, j--;
}
}
int sp = 0, sd = 0;
for (int i = 0; i < cnt; i++) {
sp += p[ans[i]];
sd += d[ans[i]];
}
printf("Jury #%d\n", T++);
printf("Best jury has value %d for prosecution and value %d for defence:\n", sp, sd);
sort(ans, ans + cnt);
for (int i = 0; i < cnt; i++) printf(" %d", ans[i]);
puts("\n");
}
return 0;
}