Memory: 1352K        Time: 94MS

 Language: C++        Result: Accepted

 #include <iostream>

 #include <vector>

 using namespace std;

 #define MAX_JURY 201

 #define MAX_CHOICE 21  //人员编号从1开始

 int dp[][];//21是人  840是辩控差   值是辩控和

 vector<int> path[][];//值是最后一条路径

 struct jury{

     int minus;//辩控差

     int sum;//辩控和

 };

 int main()

 {

     int total,choice,zero;

     jury pool[MAX_JURY];

     int eg = ;

     while(cin>>total>>choice && (total> && choice>))

     {

         zero = *choice;//实际零点值

         memset(pool,,total);

         for(int i=,pi,di;i<=total;i++)

         {

             cin>>pi>>di;

             pool[i].minus = di - pi;

             pool[i].sum = di + pi;

         }

         memset(dp,-,sizeof(dp));

         for(int i=;i<;i++)

             for(int j=;j<;j++)

                 path[i][j].clear();

         dp[][zero] = ;

         for(int k=;k<=total;k++)

         {

             for(int i=choice;i>;i--)//更新路径先长后短，避免交叉覆盖

             {

                 for(int j=;j<=*zero;j++)

                 {

                     if(dp[i-][j]>=)

                     {

                         if(dp[i][j+pool[k].minus] < dp[i-][j] + pool[k].sum)

                         {

                             dp[i][j+pool[k].minus] = dp[i-][j] + pool[k].sum;

                             path[i][j+pool[k].minus] = path[i-][j];

                             path[i][j+pool[k].minus].push_back(k);

                         }

                     }

                 }

             }

         }

         int idx;

         for(idx=;dp[choice][zero-idx]==- && dp[choice][zero+idx]==-;idx++);

         int v = dp[choice][zero-idx]>dp[choice][zero+idx]?-idx:idx;

         idx = zero + v;

         cout << "Jury #" << eg++ <<endl;

         cout << "Best jury has value "<<(dp[choice][idx]-v)/<<" for prosecution and value "<<(dp[choice][idx]+v)/<<" for defence:"<<endl;

         for(int l=;l<choice;l++)

         {

             cout << " "<< path[choice][idx][l] ;

         }

         cout<<endl;

     }
　　 return 0;

 }