UVA11729 - Commando War

#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <iostream>
using namespace std;
struct P {
	int a, b;
}job[1010];
bool cmp (P a, P b) {
	return a.b > b.b;
}
int main() {
	int N, now = 0;
	while (scanf("%d", &N) != EOF) {
		if (N == 0) break;
		for (int i = 0; i < N; ++ i) {
			scanf("%d%d", &job[i].a, &job[i].b);
		}
		sort(job, job + N, cmp);
		int s = 0, e = 0;
		for (int i = 0; i < N; ++ i) {
			s += job[i].a; e = max(e, s + job[i].b);
		}
		printf("Case %d: %d\n", ++ now, e);
	}
}