#include <bits/stdc++.h>
using namespace std;
#define int long long
struct node{
    int a,b;
    friend bool operator<(node a,node b){
    	return a.a<b.a;
    }
}p[1000005];
int n,t,sum,r1,r2,nw;
signed main(){
	return 0;
	cin>>t;
	while(t--){
		cin>>n;sum=0;
		for(int i=1;i<=n;i++){
			scanf("%lld%lld",&p[i].a,&p[i].b);
			sum+=p[i].b;
		}
		sort(p+1,p+n+1);nw=0;r1=r2=0;
		for(int i=1;i<=n;i++){
			if(p[i].b+nw<=sum/2){
				nw+=p[i].b;
				r1+=p[i].a*p[i].b;
			}else{
				r1+=(sum/2-nw)*p[i].a;
				break;
			}
		}
		nw=0;
		for(int i=n;i>=1;i--){
			if(p[i].b+nw<=sum/2){
				nw+=p[i].b;
				r2+=p[i].a*p[i].b;
			}else{
				r2+=(sum/2-nw)*p[i].a;
				break;
			}
		}
		printf("%lld\n",r2-r1);
	}
}