贪心(1)--hdu3979(贪心进阶)

                                                                                                 Monster

                                          Time Limit: 3000 MS     Memory Limit: 32768 KB     64bit IO Format: %I64d & %I64u

Description

One day, v11 encounters a group of monsters in a foreast. In order to defend the homeland, V11 picks up his weapon and fights!

All the monsters attack v11 at the same time. Every enemy has its HP, and attack value ATK. In this problem, v11 has his ATK and infinite HP. The damage (also means reduction for HP) is exactly the ATK the attacker has. For example, if v11's ATK is 13 and the monster's HP is 27, then after v11's attack, the monster's HP become 27 - 13 = 14 and vice versa.

v11 and the monsters attack each other at the same time and they could only attack one time per second. When the monster's HP is less or equal to 0 , we think this monster was killed, and obviously it would not attack any more. For example, v11's ATK is 10 and a monster's HP is 5, v11 attacks and then the monster is killed! However, a monster whose HP is 15 will be killed after v11 attack for two times. v11 will never stop until all the monsters are killed ! He wants to minimum the HP reduction for the fight! Please note that if in some second, some monster will soon be killed , the monster's attack will works too.

Input

The first line is one integer T indicates the number of the test cases. (T <=100)

Then for each case, The first line have two integers n (0<n<=10000), m (0<m<=100), indicates the number of the monsters and v11's ATK . The next n lines, each line has two integers hp (0<hp<=20), g(0<g<=1000) ,indicates the monster's HP and ATK.

Output

Output one line.

First output “Case #idx: ”, here idx is the case number count from 1. Then output the minimum HP reduction for v11 if he arrange his attack order optimal .

Sample Input

2 
3 1 
1 10 
1 20 
1 40 
1 10 
7 3

Sample Output

Case #1: 110 
Case #2: 3

                        

         这道题是在团队内的组队赛时遇到的，下来后发现了一份思路清晰的题解，偷个懒，题解直接copy别人的，题意大致如下：一个游侠和多个怪兽决斗，怎么样击杀怪兽会使游侠的耗血最少。这其中的关键是怪兽不会一个一个的跟你打，他们也不傻，他们对你群殴，在这里给大家举个例子假如有两个怪兽Ａ和Ｂ，Ａ怪兽的血量为HＰA，攻击力为ＳＡ，Ｂ怪兽的血量为HPB，攻击力为SB，游侠的攻击力为ｍ，现在有两种方法，一：先击杀Ａ后击杀Ｂ。二：先击杀Ｂ后击杀Ａ。一耗血量：（ＨＰＡ／ｍ）＊（ＳＡ＋ＳＢ）＋（ＨＰＢ／ｍ）＊ＳＢ．同理二耗血量为：（HPB／ｍ）＊（ＳＡ＋ＳＢ）＋（HPＡ／ｍ）＊SA。接下来就是比较两种方法哪一种耗血比较少了。即比较ＨＰＡ＊ＳＢ与HPB＊SA的大小。所以接下来的问题就迎刃而解了。下面附上的AC代码：

#include <stdio.h>
#include <algorithm>
#include <math.h>
#define LL long long
using namespace std;
struct node
{
	LL hp,at;
};
node mon[10005];
bool cmp(node a,node b)
{
	return a.hp*b.at<a.at*b.hp; 
}
int main()
{
	LL T,i,j;
	LL  n,m;
	scanf("%lld",&T);
	LL cas=1;
	while(T--)
	{
		long long sum=0,ans=0;
		scanf("%lld %lld",&n,&m);
		for(i=0;i<n;i++)
		{
			scanf("%lld%lld",&mon[i].hp,&mon[i].at);                             
			mon[i].hp=(LL)ceil((double)mon[i].hp/(double)m);   //必须对精度进行处理，不然wrong answer 
			sum+=(long long)mon[i].at;
		} 
		sort(mon,mon+n,cmp);
		for(i=0;i<n;i++)
		{
			ans+=(long long)sum*mon[i].hp;
			sum-=mon[i].at;
		}
		printf("Case #%lld: ",cas++);
		printf("%lld\n",ans);
	}
	return 0;
}