UVA-11729

UVA-11729  Commando War

#include<stdio.h>
#include<algorithm>
using namespace std;
int soldier[1000][2];
int ans[1000],temp,out;
bool cmp(int a,int b){
    return soldier[a][1]>soldier[b][1];
}
int main(){
    int cases=0,n;
    while(scanf("%d",&n) && n){
        cases++;
        temp=0;out=0;
        for(int i=0;i<n;i++){
            scanf("%d%d",&(soldier[i][0]),&(soldier[i][1]));
            ans[i]=i;
        }
        sort(ans,ans+n,cmp);
        for(int i=0;i<n;i++){
            out+=soldier[ans[i]][0];
            temp=(temp>out+soldier[ans[i]][1])?(temp):(out+soldier[ans[i]][1]);    
        }
        out+=soldier[ans[n-1]][1];
        printf("Case %d: %d\n",cases,temp>out?temp:out);
    }
return 0;    
}

這題也是一開始一直RE，莫名其妙 030