LDU暑假集训（三）1269 Problem H H. Fight Against Monsters

It is my great honour to introduce myself to you here. My name is Aloysius Benjy Cobweb Dartagnan Egbert Felix Gaspar Humbert Ignatius Jayden Kasper Leroy Maximilian. As a storyteller, today I decide to tell you and others a story about the hero Huriyyah, and the monsters.

Once upon a time, citizens in the city were suffering from n powerful monsters. They ate small children who went out alone and even killed innocent persons. Before the hero appeared, the apprehension had overwhelmed the people for several decades. For the good of these unfortunate citizens, Huriyyah set off to the forest which was the main lair of monsters and fought with n fierce and cruel monsters. The health point of the i-th monster was HPi , and its attack value was ATKi .

They fought in a cave through a turn-based battle. During each second, the hero Huriyyah was attacked by monsters at first, and the damage was the sum of attack values of all alive monsters. Then he selected a monster and attacked it. The monster would suffer the damage of k (its health point would decrease by k) which was the times of attacks it had been came under. That is to say, for each monster, the damage of the first time that Huriyyah attacked it was 1, and the damage of Huriyyah’s second attack to this monster was 2, the third time to this monster was 3, and so on. If at some time, the health point of a monster was less than or equal to zero, it died. The hero won if all monsters were killed.

Now, my smart audience, can you calculate the minimum amount of total damages our hero should suffer before he won the battle?

Input

The input contains several test cases, and the first line is a positive integer T indicating the number of test cases which is up to 10^3 .

For each test case, the first line contains an integers n (1 ≤ n ≤ 105 ) which is the number of monsters. The i-th line of the following n lines contains two integers HPi and ATKi (1 ≤ HPi , ATKi ≤ 105 ) which describe a monster. We guarantee that the sum of n in all test cases is up to 10^6 .

Output

For each test case, output a line containing Case #x: y, where x is the test case number starting from 1, and y is the minimum amount of total damages the hero should suffer.

2

3

1 1

2 2

3 3

3

3 1

2 2

1 3

Case #1: 19

Case #2: 14

题意：打怪兽，对同一只怪兽攻击第i次消耗怪兽的生命值的i，当怪兽的生命值<=0时，怪兽死亡，每秒所有没死的怪兽的攻击值的和为对你造成的伤害值，求最小伤害值。

思路：将每只怪兽的生命值和攻击值存在结构体中，并算出打死每个怪兽需要的时间，也存在结构体中，结构按时间与攻击值的比值由小到大排序，计算总的伤害值即可

由于a/atk1<b/atk2==a*atk2<b*atk1

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
    int hp;
    int atk;
    int step;
}pp[100010];
int num(int a)
{
    int sum=0;
    int cnt=1;
    while(1)
    {
        sum++;
        a=a-cnt;
        if(a<=0)
            break;
        cnt++;
    }
    return sum;
}
bool cmp(node a,node b)
{
    return a.step*b.atk<b.step*a.atk;
}
int main()
{
    int t;
    scanf("%d",&t);
    int k=0;
    while(t--)
    {
        k++;
        int n,i;
        scanf("%d",&n);
        for(i=0;i<n;i++)
        {
            scanf("%d%d",&pp[i].hp,&pp[i].atk);
            pp[i].step=num(pp[i].hp);
        }
        sort(pp,pp+n,cmp);
        ll sum=0,cnt=0;
        for(i=0;i<n;i++)
        {
            cnt+=pp[i].step;
            sum+=cnt*pp[i].atk;
        }
        printf("Case #%d: %lld\n",k,sum);
 
    }
 
 
    return 0;
}