#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<string.h>
const int inf = 0x3f3f3f;
using namespace std;
int mutiply(int a[],int b[],int p,int r)
{
int i = p - 1, j = r + 1 ;
int x = a[p];
while(1)
{
i++;
while(a[i] < x)i++;
j--;
while(a[j] > x)j--;
if(i < j)
{
int ex = a[i];
a[i] = a[j];
a[j] = ex;
ex = b[i];
b[i] = b[j];
b[j] = ex;
}
else return j;
}
}
void quicksort(int a[],int b[],int p,int r)
{
if(p < r)
{
int q = mutiply(a,b,p,r);
quicksort(a,b,p,q);
quicksort(a,b,q+1,r);
}
}
int d[100001],t[100001],test,n;
int main()
{
while(scanf("%d",&test) != EOF)
{
for(int k = 1 ; k <= test ; k++)
{
scanf("%d",&n);
for(int i = 1 ; i <= n ; i++)
{
scanf("%d%d",&d[i],&t[i]);
}
quicksort(t,d,1,n);
int maxx = 0,sum = 0;
for(int i = n ; i >= 1 ; i--)
{
sum += d[i];
if(sum + t[i] > maxx)
maxx = sum + t[i];
}
printf("Case %d: %d\n",k,maxx);
}
}
}
#include<stdlib.h>
#include<math.h>
#include<iostream>
#include<string.h>
const int inf = 0x3f3f3f;
using namespace std;
int mutiply(int a[],int b[],int p,int r)
{
int i = p - 1, j = r + 1 ;
int x = a[p];
while(1)
{
i++;
while(a[i] < x)i++;
j--;
while(a[j] > x)j--;
if(i < j)
{
int ex = a[i];
a[i] = a[j];
a[j] = ex;
ex = b[i];
b[i] = b[j];
b[j] = ex;
}
else return j;
}
}
void quicksort(int a[],int b[],int p,int r)
{
if(p < r)
{
int q = mutiply(a,b,p,r);
quicksort(a,b,p,q);
quicksort(a,b,q+1,r);
}
}
int d[100001],t[100001],test,n;
int main()
{
while(scanf("%d",&test) != EOF)
{
for(int k = 1 ; k <= test ; k++)
{
scanf("%d",&n);
for(int i = 1 ; i <= n ; i++)
{
scanf("%d%d",&d[i],&t[i]);
}
quicksort(t,d,1,n);
int maxx = 0,sum = 0;
for(int i = n ; i >= 1 ; i--)
{
sum += d[i];
if(sum + t[i] > maxx)
maxx = sum + t[i];
}
printf("Case %d: %d\n",k,maxx);
}
}
}