#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>
#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
struct Node {
int a;
int b;
bool operator<(const Node& input) {
return b > input.b;
}
};
const int maxn = 10007;
int n;
Node arr[maxn];
int main()
{
int kCase = 0;
while (cin >> n && n) {
for (int i = 0; i < n; i++) {
cin >> arr[i].a >> arr[i].b;
}
sort(arr, arr + n);
int ans = 0, cur = 0;
for (int i = 0; i < n; i++) {
cur += arr[i].a;
ans = max(cur + arr[i].b, ans);
}
cout << "Case "<<++kCase << ": "<< ans << endl;
}
return 0;
}
uva11729
最新推荐文章于 2023-12-02 13:59:34 发布