Submission #1203764

#TimeUsernameProblemLanguageResultExecution timeMemory
1203764chawinknArt Exhibition (JOI18_art)C++20
100 / 100
115 ms8264 KiB
#include <bits/stdc++.h> using namespace std; #define f first #define s second #define ll long long int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<pair<ll,ll>> a(n); for (auto& [A,B] : a) cin >> A >> B; sort(a.begin(), a.end()); ll mn=-a[0].f, ans=0, sum=0; for (int i = 1; i <= n; i++) { mn = min(mn, sum-a[i-1].f); sum += a[i-1].s; ans = max(ans, sum-a[i-1].f-mn); } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...