Hero
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3344 Accepted Submission(s): 1496
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.
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
题解:
假设已经花了t秒,现在有两个选择,所需时间分别为a1, b1和a2, b2。
先选敌人1再选敌人2所需代价为:x1 = (t + a1) * b1 + (t + a1 + a2) * b2 = t * (b1 + b2) + a1 * b1 + a2 * b2 + a1 * b2
先选敌人2再选敌人1所需代价为:x2 = (t + a2) * b2 + (t + a1 + a2) * b2 = t * (b1 + b2) + a1 * b1 + a2 * b2 + a1 * b1
我们发现,这两个的顺序选择值与最后一项有关,
所以我们可以重载一个结构体的小于号, 然后排序贪心选择即可。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct node{
int a, b;
bool operator<(const node & X) const{
return a * X.b < X.a * b;
}
}Node[30];
int main() {
int n;
while (~scanf("%d", &n)) {
for (int i = 0; i < n; ++i)
scanf("%d%d", &Node[i].a, &Node[i].b);
sort(Node, Node + n);
int ans = 0;
int t = 0;
for (int i = 0; i < n; ++i) {
t += Node[i].a;
ans += t * Node[i].b;
}
printf("%d\n", ans);
}
return 0;
}