Submission #1204639

#TimeUsernameProblemLanguageResultExecution timeMemory
1204639toast12Art Exhibition (JOI18_art)C++20
50 / 100
1093 ms8004 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n; cin >> n; vector<pair<ll, ll>> v(n); for (int i = 0; i < n; i++) cin >> v[i].first >> v[i].second; sort(v.begin(), v.end()); ll ans = 0; for (int i = 0; i < n; i++) { ll sum = 0; for (int j = i; j < n; j++) { sum += v[j].second; ans = max(ans, sum-(v[j].first-v[i].first)); } } cout << ans << '\n'; 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...