#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1e5+5;
typedef long long ll;
inline ll read(){char c=getchar();ll x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}
int n;
struct cow{ll t,w;bool operator < (const cow &r)const{return t*r.w<r.t*w;}
}a[N];
ll sum=0,ans=0;
int main(){//freopen("flower.in","r",stdin);//freopen("flower.out","w",stdout);n=read();for(int i=1;i<=n;i++){a[i].t=2*read();a[i].w=read();sum+=a[i].w;}sort(a+1,a+1+n);for(int i=1;i<=n;i++){sum-=a[i].w;ans+=sum*a[i].t;}printf("%lld\n",ans);
}

//60
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1e5+5;
typedef long long ll;
const ll INF=1e18;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}
int n,k,w[N];
ll f[N];
void dp(){f[0]=0;for(int i=1;i<=n;i++) f[i]=-INF;for(int i=1;i<=n;i++){int tmp=f[0];f[0]=max(f[0],f[k]);for(int j=k;j>=2;j--){f[0]=max(f[0],f[j-1]);f[j]=f[j-1]+w[i];//printf("%d %d %d\n",i,j,f[j]);
        }f[1]=tmp+w[i];//printf("%d 0 %d\n",i,f[0]);//printf("%d 1 %d\n",i,f[1]);
    }
}
int main(){freopen("mowlawn.in","r",stdin);freopen("mowlawn.out","w",stdout);n=read();k=read();for(int i=1;i<=n;i++) w[i]=read();dp();ll ans=-INF;for(int i=0;i<=k;i++) ans=max(ans,f[i]);printf("%lld",ans);
}

//AC
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=1e5+5;
typedef long long ll;
const ll INF=1e18;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}
int n,k,w[N];
ll f[N],sum=0;
int q[N],head=1,tail=0;
void dp(){q[++tail]=0;for(int i=1;i<=n;i++){while(i-q[head]-1>k) head++;f[i]=f[q[head]]+w[i];while(f[q[tail]]>=f[i]&&head<=tail) tail--;q[++tail]=i;//printf("f %d %d\n",i,f[i]);
    }
}
int main(){//freopen("mowlawn.in","r",stdin);//freopen("mowlawn.out","w",stdout);n=read();k=read();for(int i=1;i<=n;i++) w[i]=read(),sum+=w[i];dp();ll mn=INF;for(int i=n-k;i<=n;i++) mn=min(mn,f[i]);printf("%lld",sum-mn);
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int N=505,M=1e4,INF=1e9;
typedef long long ll;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}
int T,n,m,mm,u,v,w;
struct edge{int v,ne,w;
}e[M];
int cnt=0,h[N];
inline void ins(int u,int v,int w){cnt++;e[cnt].v=v;e[cnt].w=w;e[cnt].ne=h[u];h[u]=cnt;
}
int d[N],inq[N],num[N];
bool spfa(){queue<int> q;memset(inq,0,sizeof(inq));memset(num,0,sizeof(num));for(int i=1;i<=n;i++) d[i]=INF;q.push(1);inq[1]=1;d[1]=0;while(!q.empty()){int u=q.front();q.pop();inq[u]=0;for(int i=h[u];i;i=e[i].ne){int v=e[i].v,w=e[i].w;if(d[u]<INF&&d[v]>d[u]+w){d[v]=d[u]+w;if(!inq[v]){q.push(v);inq[v]=1;if(++num[v]>=n) return false;}}}}return true;
}
int main(){freopen("wormhole.in","r",stdin);freopen("wormhole.out","w",stdout);T=read();while(T--){n=read();m=read();mm=read();cnt=0;memset(h,0,sizeof(h));for(int i=1;i<=m;i++){u=read();v=read();w=read();ins(u,v,w);ins(v,u,w);}for(int i=1;i<=mm;i++){u=read();v=read();w=read();ins(u,v,-w);}if(!spfa()) printf("YES\n");else printf("NO\n");}
}