HDU 4310 贪心(有证明)

http://acm.hdu.edu.cn/showproblem.php?pid=4310

When playing DotA with god-like rivals and pig-like team members, you have to face an embarrassing situation: All your teammates are killed, and you have to fight 1vN.

There are two key attributes for the heroes in the game, health point (HP) and damage per shot (DPS). Your hero has almost infinite HP, but only 1 DPS.

To simplify the problem, we assume the game is turn-based, but not real-time. In each round, you can choose one enemy hero to attack, and his HP will decrease by 1. While at the same time, all the lived enemy heroes will attack you, and your HP will decrease by the sum of their DPS. If one hero's HP fall equal to (or below) zero, he will die after this round, and cannot attack you in the following rounds.

Although your hero is undefeated, you want to choose best strategy to kill all the enemy heroes with minimum HP loss.

Input

The first line of each test case contains the number of enemy heroes N (1 <= N <= 20). Then N lines followed, each contains two integers DPSi and HPi, which are the DPS and HP for each hero. (1 <= DPSi, HPi <= 1000)

Output

Output one line for each test, indicates the minimum HP loss.

Sample Input

1
10 2
2
100 1
1 100

Sample Output

20
201

题目大意：给出n个敌人的hp和dps，你的dps只有1，求出干掉所有敌人所消耗的最少的生命值。

思路：贪心，我们假设现在有敌人1号：hp=h1，dps=d1；有敌人2号：hp=h2，dps=d2；那么先干掉1号敌人所消耗的生命值：cost1=h1*d1+d2*(h1+h2)；先干掉2号敌人所消耗的生命值：cost2=h2*d2+d1*(h1+h2)；若cost1>cost2，即d2/h2>d1/h1，则应该先干掉2号敌人；假设现在有3个人，对于先杀1再杀2还是先杀2再杀1得到的结论跟上述一致，那么对于先杀1再杀3还是先杀3再杀1等等诸如此类的问题也能得到一致的结论，由此我们可将结论推广：先干掉dps/hp最大的。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

struct node
{
	int hp,dps;
	double val;
};

bool cmp(node a,node b)
{
	return a.val>b.val;
}
node a[25];
int n;

int main()
{
	while(~scanf("%d",&n))
	{
		long long sum=0,dsum=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d %d",&a[i].hp,&a[i].dps);
			a[i].val=a[i].dps*1.0/a[i].hp;
			dsum+=a[i].dps;
		}
		sort(a,a+n,cmp);
		for(int i=0;i<n;i++)
		{
			sum+=a[i].hp*dsum;
			dsum-=a[i].dps;
		}
		printf("%lld\n",sum);
	}
	return 0;
}