贪心 hero

题目：

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个敌方英雄，我方一个英雄，dps为1，hp无限，求消灭敌方所有英雄承受的最少伤害。
开一个结构体数组，struct hero{int dps;int hp;}a[105];
将元素按下列式子从小到大排序： 
 (((a.dps+b.dps)*a.hp+b.dps*b.hp) < ((a.dps+b.dps)*b.hp+a.hp*a.dps))
可得应先消灭哪个英雄，最后计算承受总伤害。

代码：

#include <stdio.h>
#include <algorithm>
#include <math.h>
using namespace std;
struct hero
{
    int dps;
    int hp;
}a[105];
bool cmp(hero a,hero b)
{
     return  (((a.dps+b.dps)*a.hp+b.dps*b.hp) < ((a.dps+b.dps)*b.hp+a.hp*a.dps));
}
int main()
{
    int n;
    while(~scanf("%d",&n)&&n)
    {
        int sum=0;
        long long int loss;
        loss=0;
        for(int i=0;i<n;i++)
        {
            scanf("%d %d",&a[i].dps,&a[i].hp);
            sum+=a[i].dps;
        }
        sort(a,a+n,cmp);
        for(int i=0;i<n;i++)
        {
            loss+=a[i].hp*sum;
            sum-=a[i].dps;
        }
        printf("%lld\n",loss);
    }
    return 0;
}