HDU 3979 Monster (贪心排序)

Monster

Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1383    Accepted Submission(s): 363

Problem Description

One day, v11 encounters a group of monsters in a foreast. In order to defend the homeland, V11 picks up his weapon and fights!

All the monsters attack v11 at the same time. Every enemy has its HP, and attack value ATK. In this problem, v11 has his ATK and infinite HP. The damage (also means reduction for HP) is exactly the ATK the attacker has. For example, if v11's ATK is 13 and the monster's HP is 27, then after v11's attack, the monster's HP become 27 - 13 = 14 and vice versa.

v11 and the monsters attack each other at the same time and they could only attack one time per second. When the monster's HP is less or equal to 0 , we think this monster was killed, and obviously it would not attack any more. For example, v11's ATK is 10 and a monster's HP is 5, v11 attacks and then the monster is killed! However, a monster whose HP is 15 will be killed after v11 attack for two times. v11 will never stop until all the monsters are killed ! He wants to minimum the HP reduction for the fight! Please note that if in some second, some monster will soon be killed , the monster's attack will works too.

 

 

Input

The first line is one integer T indicates the number of the test cases. (T <=100)

Then for each case, The first line have two integers n (0<n<=10000), m (0<m<=100), indicates the number of the monsters and v11's ATK . The next n lines, each line has two integers hp (0<hp<=20), g(0<g<=1000) ,indicates the monster's HP and ATK.

 

 

Output

Output one line.

First output “Case #idx: ”, here idx is the case number count from 1. Then output the minimum HP reduction for v11 if he arrange his attack order optimal .

 

 

Sample Input

2 3 1 1 10 1 20 1 40 1 10 7 3

 

 

Sample Output

Case #1: 110 Case #2: 3

 

 

Author

v11

 

 

Source

2011 Multi-University Training Contest 14 - Host by FZU

 

 

排序一下就解决了，注意用long long 就可以了。

 

/* ***********************************************
Author        :kuangbin
Created Time  :2013-11-17 21:24:55
File Name     :E:\2013ACM\比赛练习\2013-11-17\G.cpp
************************************************ */

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std;

struct Node
{
    int h,g;
}node[10010];
int n,m;
bool cmp(Node a,Node b)
{
    return a.h*b.g < b.h*a.g;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int T;
    int iCase = 0;
    scanf("%d",&T);
    while(T--)
    {
        iCase ++;
        scanf("%d%d",&n,&m);
        for(int i = 0;i < n;i++)
        {
            scanf("%d%d",&node[i].h,&node[i].g);
            node[i].h = (node[i].h + m - 1)/m;
        }
        sort(node,node+n,cmp);
        long long ans = 0;
        int cnt = 0;
        for(int i = 0;i < n;i++)
        {
            cnt += node[i].h;
            ans += (long long)cnt*node[i].g;
        }
        printf("Case #%d: %I64d\n",iCase,ans);
    }
    return 0;
}