Submission #782809

#TimeUsernameProblemLanguageResultExecution timeMemory
782809borisAngelovArt Exhibition (JOI18_art)C++17
50 / 100
1008 ms20664 KiB
#include <bits/stdc++.h> using namespace std; const int maxn = 500005; int n; pair<long long, long long> a[maxn]; void fastIO() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); } int main() { fastIO(); cin >> n; for (int i = 1; i <= n; ++i) { cin >> a[i].first >> a[i].second; } sort(a + 1, a + n + 1); long long ans = -(1LL << 62); for (int i = 1; i <= n; ++i) { ans = max(ans, a[i].second); long long sum = a[i].second; for (int j = i + 1; j <= n; ++j) { sum += a[j].second; ans = max(ans, sum - (a[j].first - a[i].first)); } } cout << ans << endl; 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...