Submission #1261505

#TimeUsernameProblemLanguageResultExecution timeMemory
1261505sohamsen15Art Exhibition (JOI18_art)C++20
50 / 100
1096 ms12108 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); ll n; cin >> n; vector<pair<ll, ll>> a(n); for (auto &x: a) cin >> x.first >> x.second; sort(a.begin(), a.end()); vector<ll> p(n + 1); p[0] = 0; for (ll i = 0; i < n; i++) p[i + 1] = a[i].second + p[i]; ll ans = 0; for (ll i = 0; i < n; i++) for (ll j = i; j < n; j++) ans = max(ans, p[j + 1] - p[i] - (a[j].first - a[i].first)); cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...