hdu4310 Hero(贪心)-优快云博客

本文探讨了一种针对1vN游戏场景的最优策略算法，玩家需面对神级对手及猪级队友的情况，在无限生命值但低攻击力的条件下，通过合理选择攻击目标以最小化损失。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Hero

Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2658 Accepted Submission(s): 1196

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

Sample Output

20
201

思路：DPS/血量从大到小排序，即输出高的英雄先杀，然后暴力遍历即可，贴代码一看就懂。

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 30;
int m;
long long total;
struct Map
{
    int DPS;
    int HP;
} p[maxn];
bool cmp(struct Map a,struct Map b) //先从伤害高的英雄先杀
{
    return a.DPS * b.HP > b.DPS * a.HP;
}
void judge(int num)
{
    if(num > m)
    {
        return;
    }
    int i,j;
    for(i=1; i<=p[num].HP; i++) //因为每次掉一滴血，所以每个敌方英雄的HP可以理解为要杀HP血量次那只英雄才能死
    {
        for(j=num; j<=m; j++)   //每次从num个敌方英雄开始遍历，因为前面的英雄已经被杀死了
        {
            total += p[j].DPS;
        }
    }
    judge(num+1);   //因为敌方英雄被杀死了，所以从下个英雄开始
}
int main()
{
    int i;
    //freopen("1.in","r",stdin);
    while(cin>>m)
    {
        total = 0;
        for(i=1; i<=m; i++)
        {
            cin>>p[i].DPS>>p[i].HP;
        }
        sort(p+1,p+m+1,cmp);
        /*for(i=1;i<=m;i++)
        {
            cout<<p[i].DPS<<" "<<p[i].HP<<endl;
        }*/
        judge(1);   //初始化为第一个英雄
        cout<<total<<endl;
    }
    return 0;
}