1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48
| #include<iostream> #include<stdio.h> #include<algorithm> #include<map> #include<queue> #include<vector> #include<cstring> #include<stack> #define mem(ss) memset(ss,0,sizeof(ss)) #define fo(d,s,t) for(int d=s;d<=t;d++) #define fo0(d,s,t) for(int d=s;d>=t;d--) typedef long long ll; typedef long double ld; typedef __int128 lll; const ll mod=1e9+7; #define io_opt ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) using namespace std; ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);} inline int read(){int data=0;char ch=0;while (ch<'0' || ch>'9') ch=getchar();while (ch>='0' && ch<='9') data=data*10+ch-'0',ch=getchar();return data;} ll n,cnt1,cnt2,ansx,ans; struct E{ int x,w; }e[10020]; int cmp(E x,E y){ return x.x<y.x; } int main(){ io_opt; cin>>n; fo(i,1,n){ cin>>e[i].x>>e[i].w; cnt1+=e[i].w; } sort(e+1,e+1+n,cmp); cnt1=cnt1/2+1; fo(i,1,n){ cnt2+=e[i].w; if(cnt2>=cnt1){ ansx=e[i].x; break; } } fo(i,1,n){ ans+=abs(ansx-e[i].x)*e[i].w; } cout<<ans<<endl; return 0; }
|