Submission #383195

#TimeUsernameProblemLanguageResultExecution timeMemory
383195ritul_kr_singhArt Exhibition (JOI18_art)C++17
100 / 100
247 ms28780 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define sp << " " << #define nl << "\n" signed main(){ cin.tie(0)->sync_with_stdio(0); int n; cin >> n; array<int, 2> s[n]; for(auto &i : s) cin >> i[0] >> i[1]; sort(s, s+n); int L[n], R[n]; R[0] = s[0][1]; L[0] = -s[0][0]; for(int i=1; i<n; ++i){ R[i] = s[i][1] + R[i-1]; L[i] = R[i-1] - s[i][0]; } for(int i=0; i<n; ++i) R[i] -= s[i][0]; int currMin = 1e18, res = -1e18; for(int i=0; i<n; ++i){ currMin = min(currMin, L[i]); res = max(res, R[i] - currMin); } cout << res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...