2014
02-24

# Uva-11729-Commando War[贪心]

Commando War

Input

There will be multiple test cases in the input file. Every test case starts with an integer N (1<=N<=1000), denoting the number of soldiers. Each of the following N lines describe a soldier with two integers B (1<=B<=10000) J (1<=J<=10000)seconds are needed to brief the soldier while completing his job needs seconds. The end of input will be denoted by a case with N =0 . This case should not be processed.

Output

For each test case, print a line in the format, Case X: Y, where X is the case number & Y is the total number of seconds counted from the start of your first briefing till the completion of all jobs.

3
2 5
3 2
2 1
3
3 3
4 4
5 5
0

Case 1: 8
Case 2: 15

//============================================================================
// Name        : uva-28436.cpp
// Author      : coder
// Version     :
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <algorithm>
#include <stdio.h>
using namespace std;
struct N{
int b,j;
int x;
};
N arr[1001];
bool cmp(const  N & n1,const N&  n2){
return n1.j > n2.j;
}
int main() {
//freopen("in.txt", "r", stdin);
int n;
int c = 0;
while( cin >> n,n){
c++;
for(int i=0; i<n; i++){
cin >> arr[i].b >> arr[i].j;
arr[i].x = arr[i].j-arr[i].b;
}
sort(arr, arr+n, cmp);
int mx = 0, time = 0;
for(int i=0; i<n; i++){
time += arr[i].b;
if(arr[i].j + time > mx){
mx = arr[i].j + time;
}
}
cout << "Case " << c <<": " << mx << endl;
}
return 0;
}

1. Excellent Web-site! I required to ask if I might webpages and use a component of the net web website and use a number of factors for just about any faculty process. Please notify me through email regardless of whether that would be excellent. Many thanks