UVA11729_Commando War

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#define MAX(a,b) (a)>(b)?(a):(b)
using namespace std;

struct TimePoint{
int speakTime;
int workTime;
};
vector<TimePoint> timePoint;

bool cmp(TimePoint p1, TimePoint p2){
return p1.workTime >= p2.workTime;
}
int main()
{
int n,count=1;
int i,curTime,tarTime;
while (cin>>n && n!=0){
i = curTime = tarTime= 0;		//initialize
timePoint.clear();
while (n--){
TimePoint point;
scanf("%d %d", &point.speakTime, &point.workTime);
timePoint.push_back(point);
}
sort(timePoint.begin(), timePoint.end(), cmp);

for (int j = 0; j < timePoint.size(); j++){
curTime += timePoint[j].speakTime;
tarTime = MAX(tarTime
4000
, curTime + timePoint[j].workTime);
}
cout << "Case " << count++ << ": " << tarTime << endl;
}

return 0;
}