hdu 4310(水一题贪心)

# include <stdio.h>
# include <algorithm>
using namespace std;
struct node
{
	int dps;
	int hp;
};
struct node a[25];
int cmp(node a1,node b)
{
	return a1.dps*b.hp>b.dps*a1.hp;//攻击乘另一个人的hp大的放在最前 、、最优
}
int main()
{
	int n,i,sum,sum1;
	while(~scanf("%d",&n))
	{
		sum=0;
		for(i=0;i<n;i++)
		{
			scanf("%d%d",&a[i].dps,&a[i].hp);
		    sum+=a[i].dps;
		}
		sort(a,a+n,cmp);
		sum1=0;
		for(i=0;i<n;i++)
		{
		     sum1+=a[i].hp*sum;
			 sum-=a[i].dps;
		}
		printf("%d\n",sum1);
	}
	return 0;
}