显示代码纯文本
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
int N,Ans;
class mission
{
public:
int talk,work;
}soldier[1001];
bool op(mission x,mission y)
{
return x.work>y.work;
}
int main()
{
freopen("commando.in","r",stdin);
freopen("commando.out","w",stdout);
scanf("%d",&N);
int T=0;
while(N)
{
T++;
for(int i=1;i<=N;i++)
scanf("%d%d",&soldier[i].talk,&soldier[i].work);
sort(soldier+1,soldier+N+1,op);
int t=0;
Ans=0;
for(int i=1;i<=N;i++)
{
t+=soldier[i].talk;
Ans=max(t+soldier[i].work,Ans);
}
//for(int i=1;i<=N;i++)
// printf("%d %d\n",soldier[i].talk,soldier[i].work);
printf("Case %d: %d\n",T,Ans);
scanf("%d",&N);
}
return 0;
}