就一个排序,代码如下
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct Node
{
int t,d;
}a[100005];
bool cmp(Node a,Node b)
{
return a.t*b.d<b.t*a.d;
}
int main()
{
int n;
while(~scanf("%d",&n)){
long long ans=0,sum=0;
for(int i=0;i<n;i++){
scanf("%d%d",&a[i].t,&a[i].d);
sum+=(long long)a[i].d;
}
sort(a,a+n,cmp);
for(int i=0;i<n;i++){
sum-=(long long)a[i].d;
ans+=2*sum*(long long)a[i].t;
}
printf("%lld\n",ans);
}
}