【HDOJ】【BC91】Lotus and Characters

传送门 acm.hdu.edu.cn/showproblem.php?pid=6011

Solution

纯暴力……

比赛时一脸智障地被叉掉了QwQ

#include<stdio.h>
#include<algorithm>
using namespace std;

struct node
{
    int v,c;
    inline void in()
    {
        scanf("%d%d",&v,&c);
    }
    friend bool operator < (node a,node b)
    {
        return b.v<a.v;
    }
}t[30];

int main()
{
    int T,n,ans,tot,now;
    scanf("%d",&T);
    while (T--)
    {
        scanf("%d",&n);
        for (int i=1;i<=n;i++) t[i].in();
        sort(t+1,t+n+1);
        ans=tot=now=0;
        for (int i=1;i<=n;i++) for (int j=1;j<=t[i].c;j++)
        {
            tot+=t[i].v;
            now+=tot;
            ans=max(ans,now);
        }
        printf("%d\n",ans);
    }
}