hdu---(4310)Hero(贪心算法)

G11176593

于 2022-11-29 10:48:36 发布

阅读量101

点赞数

文章标签：贪心算法算法

本文链接：https://blog.csdn.net/g11176593/article/details/128058525

版权

本文探讨了一种简化后的 DotA 游戏场景，玩家需面对1v多挑战，通过分析英雄伤害和生命值，提供了如何通过最优化策略最小化生命损失的算法。问题涉及计算每轮攻击后剩余敌人的总伤害，给出一个示例和代码实现。

摘要由CSDN通过智能技术生成

Hero

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

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

Author

TJU

Source

2012 Multi-University Training Contest 2

代码：先是模拟，然后优化，之后得到这么一个jiahuo ....

 1 #include<cstring>
 2 #include<cstdio>
 3 #include<algorithm>
 4 using namespace std;
 5 struct node{
 6   int HP,DSP;
 7   bool operator < (const node & a)const{
 8       return DSP*a.HP>a.DSP*HP;
 9   }
10 };
11 node st[22];
12 int main(){
13 
14   int n;
15   int ans;
16 // freopen("test.in","r",stdin);
17   while(scanf("%d",&n)!=EOF){
18       ans=0;
19      for(int i=0;i<n;i++){
20       scanf("%d%d",&st[i].HP,&st[i].DSP);
21      }
22      sort(st,st+n);
23      for(int i=0;i<n;i++){
24         for(int j=i;j<n;j++){
25              ans+=st[j].DSP*st[i].HP;
26        }
27      }
28    printf("%d\n",ans);
29   }
30 return 0;
31 }

View Code