hdu 3979 贪心

简单贪心,不过wa了,没找出原因,先上一个别人过的代码:

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
struct node
{
    LL hp;
    LL g;
    LL t;
}monster[10005];
bool cmp(const struct node &a,const struct node &b)
{
    return (double)a.g/a.t>(double)b.g/b.t;
}
int main()
{
    int T,n,m;
    scanf("%d",&T);
    for(int tt=1;tt<=T;++tt)
    {
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;++i)
        {
            scanf("%I64d%I64d",&monster[i].hp,&monster[i].g);
            monster[i].t=(monster[i].hp/m+((monster[i].hp%m)?1:0));
        }
        sort(monster,monster+n,cmp);
        LL reduction=0,t=0;
        for(int i=0;i<n;++i)
        {
            t+=monster[i].t;
            reduction+=(t*monster[i].g);
        }
        printf("Case #%d: %I64d\n",tt,reduction);
    }
    return 0;
}

我自己的wa的代码,求解:

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
struct N
{
    long long hp,atk,t;//消灭这个怪物需要的时间
};
bool cmp(N a,N b)
{
    return (double)a.atk/a.t > (double)b.atk/b.t ;//比较的时候要用实际消灭怪物的时间,不是用怪物的hp哦
}
int main()
{
    freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int ncase,n,m,i,j;
    N mon[10000];
    cin>>ncase;
    for(i=1;i<=ncase;i++)
    {
        cin>>n>>m;
        for(j=0;j<n;j++)
        {
            cin>>mon[j].hp>>mon[j].atk;
            mon[j].t=mon[j].hp/m;
            if(mon[j].hp%m) mon[j].t++;
        }
        long long time=0;//time表示消灭这个怪物已经经过的时间
        long long ans=0;
        sort(mon,mon+n,cmp);
        //for(j=0;j<n;j++) cout<<mon[j].hp<<" "<<mon[j].atk<<endl;
        for(j=0;j<n;j++)
        {
            time +=mon[j].t;
            ans +=mon[j].atk*time;
        }
        printf("Case #%d: %lld\n",i,ans);
    }
    return 0;
}