UVA 11729 - Commando War

#include <iostream>
#include <memory.h>
#include <algorithm>
#include <cstdio>
using namespace std;
#define MAX 1010

struct node
{
int b,j;
bool operator<(const node & rhs)const{
return j>rhs.j;
}
}soldiers[MAX];
int n;
int main(){
int cas=1;
while (scanf("%d",&n)&&n)
{
int cost=0,maxJobTimeLeft=0;
for(int i=0;i<n;++i)scanf("%d %d",&soldiers[i].b,&soldiers[i].j);
sort(soldiers,soldiers+n);
for (int i=0;i<n;++i)
{
cost+=soldiers[i].b;
maxJobTimeLeft-=soldiers[i].b;
if(soldiers[i].j>maxJobTimeLeft)maxJobTimeLeft=soldiers[i].j;
}
printf("Case %d: %d\n",cas++,cost+maxJobTimeLeft);
}
}