HDU 4310 Hero

Problem Description

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个敌方英雄给出其攻击力和血量，你拥有无限的血量，敌方每次给你造成的伤害为敌方现存英雄伤害的总和，问消灭所有敌方英雄所花费的最小代价是多少

思路：计算出每个敌方英雄攻击力与血量的比值，比值越高的代表在相应的血量下造成的损害越多，因此要先消灭比值高的；于是我们将敌方英雄按比值排序即可

AC代码：

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

const int N=25;

int n;
struct Hero
{
	int dps,hp;
	double d;
	bool operator<(const Hero&t)const
	{
		return d>t.d;
	}
}h[N];

int main()
{
	while(cin>>n)
	{
		int sum=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d%d",&h[i].dps,&h[i].hp);
			h[i].d=1.0*h[i].dps/h[i].hp;
			sum+=h[i].dps;
		}
		sort(h,h+n);
		int res=0;
		for(int i=0;i<n;i++)
		{
			res+=sum*h[i].hp;
			sum-=h[i].dps;
		}
		cout<<res<<endl;
	}
}