Submission #912443

#TimeUsernameProblemLanguageResultExecution timeMemory
912443vjudge1Potatoes and fertilizers (LMIO19_bulves)C++17
0 / 100
1061 ms600 KiB
#include <bits/stdc++.h> #define f first #define s second #define ent '\n' #define int long long #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #pragma GCC optimize("Ofast,unroll-loops,fast-math,O3") using namespace std; typedef long long ll; const int mx=1e6+12; const int mod=1e9+7; int dx[]={1,-1,0,0,1,-1,1,-1}; int dy[]={0,0,1,-1,1,-1,-1,1}; int a[mx]; int n,m,k; void Press_Fn_with_F11(){ cin>>n; set<int> s; for(int i=1;i<=n;i++){ int x,y; cin>>x>>y; a[i]=y-x; if(a[i]>0)s.insert(i); } int ans=0; for(int i=1;i<=n;i++){ while(a[i]<0){ int j=*s.begin(); s.erase(s.begin()); int x=min(-a[i],a[j]); ans+=x*abs(i-j); a[i]+=x; a[j]-=x; if(a[j]>0)s.insert(a[j]); } } cout<<ans<<ent; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int Alikhan_abi_crush=1; // cin>>Alikhan_abi_crush; while(Alikhan_abi_crush--){ Press_Fn_with_F11(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...