zoukankan      html  css  js  c++  java
  • Dragon of Loowater

    Time Limit: 1000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu

    []   [Go Back]   [Status]  

    Description

    Download as PDF

    Problem C: The Dragon of Loowater

    Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem.

    The shores of Rellau Creek in central Loowater had always been a prime breeding ground for geese. Due to the lack of predators, the geese population was out of control. The people of Loowater mostly kept clear of the geese. Occasionally, a goose would attack one of the people, and perhaps bite off a finger or two, but in general, the people tolerated the geese as a minor nuisance.

    One day, a freak mutation occurred, and one of the geese spawned a multi-headed fire-breathing dragon. When the dragon grew up, he threatened to burn the Kingdom of Loowater to a crisp. Loowater had a major problem. The king was alarmed, and called on his knights to slay the dragon and save the kingdom.

    The knights explained: "To slay the dragon, we must chop off all its heads. Each knight can chop off one of the dragon's heads. The heads of the dragon are of different sizes. In order to chop off a head, a knight must be at least as tall as the diameter of the head. The knights' union demands that for chopping off a head, a knight must be paid a wage equal to one gold coin for each centimetre of the knight's height."

    Would there be enough knights to defeat the dragon? The king called on his advisors to help him decide how many and which knights to hire. After having lost a lot of money building Mir Park, the king wanted to minimize the expense of slaying the dragon. As one of the advisors, your job was to help the king. You took it very seriously: if you failed, you and the whole kingdom would be burnt to a crisp!

    Input Specification:

    The input contains several test cases. The first line of each test case contains two integers between 1 and 20000 inclusive, indicating the number n of heads that the dragon has, and the number m of knights in the kingdom. The next n lines each contain an integer, and give the diameters of the dragon's heads, in centimetres. The following m lines each contain an integer, and specify the heights of the knights of Loowater, also in centimetres.

    The last test case is followed by a line containing:

    0 0
    

    Output Specification:

    For each test case, output a line containing the minimum number of gold coins that the king needs to pay to slay the dragon. If it is not possible for the knights of Loowater to slay the dragon, output the line:

    Loowater is doomed!
    

    Sample Input:

    2 3
    5
    4
    7
    8
    4
    2 1
    5
    5
    10
    0 0
    

    Output for Sample Input:

    11
    Loowater is doomed!
    

    #include<iostream>
    #include<algorithm>
    using namespace std;
    int a[20010],b[20010],i,j,k,m,n,sn;
    int main()
    {
    	while(cin>>m>>n)
    	{
    		if(n==0&&m==0)
    			break;
    		sn=0;
    	for(i=0;i<m;i++)
    		cin>>a[i];
    	for(i=0;i<n;i++)
    		cin>>b[i];
    	sort(a,a+m);
    	sort(b,b+n);
    	j=0;
    	for(i=0;i<n;i++)
    	{
    	if(b[i]>=a[j])
    	{
    		sn+=b[i];
    		if(++j==m)
    			break;
    	}
    			
    	
    	}
     if(j<m)
    	 cout<<"Loowater is doomed!"<<endl;
     else cout<<sn<<endl;
    	}
    
    return 0;
    }


  • 相关阅读:
    原型链加强练习
    Javascript中的原型链,__proto__和prototype等问题总结
    HTTPS 到底加密了什么?
    PrismCDN 网络的架构解析,以及低延迟、低成本的奥秘
    取代 FlashP2P,H5P2P 将成为 WebP2P 主流
    低延时的P2P HLS直播技术实践
    深挖“窄带高清”的实现原理
    【省带宽、压成本专题】爱奇艺第一季度又烧了11个亿元,什么时候是个头?
    【省带宽、压成本专题】深入解析 H.265 编码模式,带你了解 Apple 全面推进 H.265 的原因
    让互联网更快,Server Push 特性及开启方式详解
  • 原文地址:https://www.cnblogs.com/gccbuaa/p/6722871.html
Copyright © 2011-2022 走看看