陪审团（多维背包）

#include<bits/stdc++.h>
using namespace std;
const int base=400;
const int N=210;
const int M=25;
int f[N][M][1000];
int p[N],d[N];
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	int T=0;
	while(n!=0&&m!=0){
		memset(f,-0x3f,sizeof f);
		f[0][0][base]=0;
		for(int i=1;i<=n;i++) scanf("%d%d",&p[i],&d[i]);
		for(int i=1;i<=n;i++){
			for(int j=0;j<=m;j++){
				for(int k=0;k<=800;k++){
					f[i][j][k]=f[i-1][j][k];
					if(k-(p[i]-d[i])<0||k-(p[i]-d[i])>800) continue;
					if(j-1<0) continue;
					f[i][j][k]=max(f[i][j][k],f[i-1][j-1][k-(p[i]-d[i])]+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;
		
		vector<int> ans;
		int i=n,j=m;int z1=0,z2=0;
		while(j){
			if(f[i][j][v]==f[i-1][j][v]) i--;
			else{
				ans.push_back(i);
				v-=(p[i]-d[i]);
				i--;
				j--;
			}
		}
		sort(ans.begin(),ans.end());
		for(int i=0;i<ans.size();i++){
			z1+=p[ans[i]];z2+=d[ans[i]];
		}
		printf("Jury #%d\n",++T);
		printf("Best jury has value %d for prosecution and value %d for defence:\n",z1,z2);
		for(int i=0;i<ans.size();i++){
			printf(" %d",ans[i]);
		}
		puts("");puts("");
		scanf("%d%d",&n,&m);
	}
	return 0;
}