Submission #144357

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