Submission #508661

#TimeUsernameProblemLanguageResultExecution timeMemory
508661CyberSleeperPotatoes and fertilizers (LMIO19_bulves)C++14
20 / 100
14 ms592 KiB
#include <bits/stdc++.h> #define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define debug(x) cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl #define fi first #define se second #define mp make_pair #define pb push_back #define ll int #define ull unsigned long long #define pii pair<int, int> #define pll pair<ll, ll> #define ld long double #define nl '\n' #define tb '\t' #define sp ' ' using namespace std; const int MX=3005, MOD=998244353, BLOCK=327, INF=1e9+7; const ll INFF=1e18+7; const ld ERR=1e-7, pi=3.14159265358979323846; ll N, A, ans; priority_queue<ll> best; int main(){ fastio; cin >> N; for(ll i=1; i<=N; i++){ ll a, b; cin >> a >> b; A+=a-b; ans+=abs(A); if(A<0){ best.push(0); best.push(0); }else{ best.push(A); best.push(A); } best.pop(); } while(best.size()){ ans-=min(A, best.top()); best.pop(); } cout << ans << nl; }

Compilation message (stderr)

bulves.cpp:19:19: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const ll INFF=1e18+7;
      |               ~~~~^~
#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...