Submission #144360

#TimeUsernameProblemLanguageResultExecution timeMemory
144360brcodePotatoes and fertilizers (LMIO19_bulves)C++14
24 / 100
559 ms14968 KiB
#include <iostream> using namespace std; const long long MAXN = 5e5+5; long long arr[MAXN]; long long pref[MAXN]; int main(){ long long n; cin>>n; for(long long i=1;i<=n;i++){ long long a,b; cin>>a>>b; arr[i] = a-b; pref[i] = pref[i-1]+arr[i]; } long long ans = 0; for(long long i=1;i<=n;i++){ ans+=abs(pref[i]); } cout<<ans<<endl; }
#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...