11729 - Commando War

最新推荐文章于 2023-03-05 15:07:52 发布

LILI-XU

最新推荐文章于 2023-03-05 15:07:52 发布

阅读量1k

点赞数 1

分类专栏： UVa Online Judge

本文链接：https://blog.youkuaiyun.com/felixtsui/article/details/9124953

版权

UVa Online Judge 专栏收录该内容

112 篇文章

订阅专栏

在面临国家战局不利的情况下，您指挥着一支小队，计划对敌方要塞进行伏击。每名士兵有不同的任务时间和简报时间，您的目标是在最短时间内完成所有任务。通过分析士兵的任务和简报时间，您将制定出最佳的简报顺序，以确保所有任务在最短的时间内完成。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

G	Commando War Input: Standard Input Output: Standard Output

“Waiting for orders we held in the wood, word from thefront never came

By evening the sound of the gunfire was miles away

Ah softly we moved through the shadows, slip awaythrough the trees

Crossing their lines in the mists in the fields on ourhands and our knees

And all that I ever, was able to see

The fire in the air, glowing red, silhouetting thesmoke on the breeze”

Thereis a war and it doesn't look very promising for your country. Now it's time toact. You have a commando squad at your disposal and planning an ambush on animportant enemy camp located nearby. You have N soldiers in your squad.In your master-plan, every single soldier has a unique responsibility and youdon't want any of your soldier to know the plan for other soldiers so thateveryone can focus on his task only. In order to enforce this, you brief everyindividual soldier about his tasks separately and just before sending him tothe battlefield. You know that every single soldier needs a certain amount oftime to execute his job. You also know very clearly how much time you need tobrief every single soldier. Being anxious to finish the total operation as soonas possible, you need to find an order of briefing your soldiers that willminimize the time necessary for all the soldiers to complete their tasks. Youmay assume that, no soldier has a plan that depends on the tasks of hisfellows. In other words, once a soldier begins a task, he can finish it without the necessity of pausing inbetween.

Input

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

Output

Foreach test case, print a line in the format, “Case X: Y”, where X is the casenumber & Y is the total number of seconds counted from the start of yourfirst briefing till the completion of all jobs.

Sample Input Output for Sample Input

2 5

3 2

2 1

3 3

4 4

5 5

Case 1: 8

Case 2: 15

#include<cstdio>
#include<cstdlib>
#define max 10005
struct data{int b;int j;}s[max];
int temp(void const *p,void const *q)
{
	return (*(data *)q).j-(*(data *)p).j;
}
int main(void)
{
	int n,i,count=0;
	while(scanf("%d",&n))
	{
		if(!n) break;
		int sum=0,ans=0;
		count++;
		for(i=0;i<n;i++)
			scanf("%d%d",&s[i].b,&s[i].j);
		qsort(s,n,sizeof(s[0]),temp);			
		for(i=0;i<n;i++)
		{
			sum+=s[i].b;
			ans=ans>sum+s[i].j?ans:sum+s[i].j;
		}
		printf("Case %d: %d\n",count,ans);
	}
	return 0;
}