zoukankan      html  css  js  c++  java
  • POJ --3045--Cow Acrobats(贪心模拟)

    Time Limit: 1000MS   Memory Limit: 65536KB   64bit IO Format: %I64d & %I64u

    Status

    Description

    Farmer John's N (1 <= N <= 50,000) cows (numbered 1..N) are planning to run away and join the circus. Their hoofed feet prevent them from tightrope walking and swinging from the trapeze (and their last attempt at firing a cow out of a cannon met with a dismal failure). Thus, they have decided to practice performing acrobatic stunts.

    The cows aren't terribly creative and have only come up with one acrobatic stunt: standing on top of each other to form a vertical stack of some height. The cows are trying to figure out the order in which they should arrange themselves ithin this stack.

    Each of the N cows has an associated weight (1 <= W_i <= 10,000) and strength (1 <= S_i <= 1,000,000,000). The risk of a cow collapsing is equal to the combined weight of all cows on top of her (not including her own weight, of course) minus her strength (so that a stronger cow has a lower risk). Your task is to determine an ordering of the cows that minimizes the greatest risk of collapse for any of the cows.

    Input

    * Line 1: A single line with the integer N.

    * Lines 2..N+1: Line i+1 describes cow i with two space-separated integers, W_i and S_i.

    Output

    * Line 1: A single integer, giving the largest risk of all the cows in any optimal ordering that minimizes the risk.

    Sample Input

    3
    10 3
    2 5
    3 3

    Sample Output

    2

    Hint

    OUTPUT DETAILS:

    Put the cow with weight 10 on the bottom. She will carry the other two cows, so the risk of her collapsing is 2+3-3=2. The other cows have lower risk of collapsing.

    Source

    USACO 2005 November Silver



    #include<cstdio>
    #include<cstring>
    #include<math.h>
    #include<algorithm>
    using namespace std;
    typedef long long LL;
    #define INF 0x3f3f3f3f
    struct node
    {
    	LL w,s;
    }cow[100100];
    int cmp(node s1,node s2)
    {
    	return s1.s+s1.w>s2.s+s2.w;
    }
    int main()
    {
    	int n;
    	while(scanf("%d",&n)!=EOF)
    	{
    		LL temp=0,ans=-INF; 
    		for(int i=0;i<n;i++)
    		scanf("%d%d",&cow[i].w,&cow[i].s);
    		sort(cow,cow+n,cmp);
    		if(n==1) ans=-cow[0].s;
    		else
    		{
    			for(int i=n-1;i>=0;i--)
    			{
    				if(temp-cow[i].s>ans)
    				ans=temp-cow[i].s;
    				temp+=cow[i].w;
    			}
    		}
    		printf("%lld
    ",ans);
    	}
    	return 0;
    } 


  • 相关阅读:
    CentOS 6.5下Git服务器搭建
    汉化Eclipse+配色方法(官方语言包)
    Cocos2d-x内存管理研究<二>
    PHP模板解析类实例
    smarty的ASSIGN()函数
    详解 $_SERVER 函数中QUERY_STRING和REQUEST_URI区别
    phpstorm 格式化代码方法
    php get_magic_quotes_gpc()函数用法介绍
    php示例代码
    MySQL数据类型:SQL_MODE设置不容忽视
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273595.html
Copyright © 2011-2022 走看看