Crawling in process... Crawling failed Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Description
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
Output
Sample Input
10 2
2
100 1
1 100
Sample Output
201
#include "iostream"
#include "algorithm" using namespace std;
struct enemy
{
int hp;
int dp;
};
enemy N[];
enemy T[];
int sum;
__int64 dead;
void ebegin(int n)
{
for (int i=;i<=n;i++)
{
cin>>N[i].dp>>N[i].hp;
sum += N[i].dp;
}
}
void defeat (int n)
{
for (int i=;i<=n;i++)
{
dead += sum * N[i].hp;
sum -= N[i].dp;
}
cout<<dead<<endl;
}
int compare (enemy x,enemy y)
{
return x.hp * y.dp < x.dp * y.hp;
}
int main()
{
int n;
while (cin>>n)
{
dead = ;
ebegin(n);
sort(N+,N+n+,compare);
defeat(n);
}
return ;
}