uva 11729

sort兩次AC

//====================================================================||
// Name        : Commando War.cpp                                              ||
// Date : 2013/7/20 下午6:48:55                                               ||
// Author : GCA                                                       ||
//                  6AE7EE02212D47DAD26C32C0FE829006                  ||
//====================================================================||
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 1005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
struct s{
    int b,j;
}solid[M];
int n;
int sec[M];
bool cmp(s a,s b){
    if(a.b==b.b)return a.j>b.j;
    return a.b<b.b;
}
bool cmp2(s a,s b){
    if(a.j==b.j)return a.b<b.b;
    return a.j>b.j;
}

int main() {
    ios_base::sync_with_stdio(0);
    int ff=0;
    while(~scanf("%d",&n)&&n){
        int minans=oo;
        int maxans=0;
        int all=0;
        for(int i=0;i<n;i++){
            scanf("%d%d",&solid[i].b,&solid[i].j);
            all+=solid[i].b;
        }
        sort(solid,solid+n,cmp);
        for(int i=0;i<n;i++)sec[i]=solid[i].j;
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                sec[i]-=solid[j].b;
            }
        }
        for(int i=0;i<n;i++){
            maxans=max(maxans,sec[i]);
        }
        minans=min(minans,maxans);
        maxans=0;
        sort(solid,solid+n,cmp2);
        for(int i=0;i<n;i++)sec[i]=solid[i].j;
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                sec[i]-=solid[j].b;
            }
        }
        for(int i=0;i<n;i++){
            maxans=max(maxans,sec[i]);
        }
        minans=min(minans,maxans);
        if(minans<0)minans=0;
        minans+=all;

        printf("Case %d: %d\n",++ff,minans);
    }

















}