zoukankan      html  css  js  c++  java
  • Commando War (贪心)

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

    By evening the sound of the gunfire was miles away

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

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

    And all that I ever, was able to see

    The fire in the air, glowing red, silhouetting the smoke on the breeze

    There is a war and it doesn't look very promising for your country. Now it's time to act. You have a commando squad at your disposal and planning an ambush on an important enemy camp located nearby. You have N soldiers in your squad. In your master-plan, every single soldier has a unique responsibility and you don't want any of your soldier to know the plan for other soldiers so that everyone can focus on his task only. In order to enforce this, you brief every individual soldier about his tasks separately and just before sending him to the battlefield. You know that every single soldier needs a certain amount of time to execute his job. You also know very clearly how much time you need to brief every single soldier. Being anxious to finish the total operation as soon as possible, you need to find an order of briefing your soldiers that will minimize the time necessary for all the soldiers to complete their tasks. You may assume that, no soldier has a plan that depends on the tasks of his fellows. In other words, once a soldier begins a task, he can finish it without the necessity of pausing in between.

    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). B seconds are 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 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.

     
    Sample Input Output for Sample Input
    3

    2 5

    3 2

    2 1

    3

    3 3

    4 4

    5 5

    0

    Case 1: 8

    Case 2: 15

     
    题解:贪心,按执行任务的时间从大到小排,得到的就是最优解

    代码:

    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    
    using namespace std;
    
    struct node
    {
    	int b,j;
    }p[1005];
    
    bool cmp(node x,node y)
    {
    	return x.j>y.j;
    }
    int main()
    {
    	int N;
    	int cnt=1;
    	while(scanf("%d",&N)&&N)
    	{
    	for(int t=0;t<N;t++)
    	{
    		scanf("%d%d",&p[t].b,&p[t].j);	
    	}
    	sort(p,p+N,cmp);
    	long long int s=0,sum=0;
    	for(int t=0;t<N;t++)
    	{
    		s+=p[t].b;
    		sum=max(sum,s+p[t].j);
    	}
    	printf("Case %d: %lld
    ",cnt++,sum);
        }
     } 
  • 相关阅读:
    Collection 和 Collections的区别?
    事务是什么?有哪些属性,并简要说明这些属性的含义。
    jsp有哪些内置对象?作用分别是什么?(至少三个)
    谈谈对XML的理解?说明Web应用中Web.xml文件的作用?
    类有哪三个基本特性?各特性的优点?
    Oracle安装完成后,如何用命令行启动和关闭数据库?
    请说明SQLServer中delete from tablea & truncate table tablea的区别
    试述数据库完整保护的主要任务和措施。
    存储过程和函数的区别
    性能
  • 原文地址:https://www.cnblogs.com/Staceyacm/p/10781996.html
Copyright © 2011-2022 走看看