Submission #1037022

#TimeUsernameProblemLanguageResultExecution timeMemory
1037022ArthuroWichArt Exhibition (JOI18_art)C++17
50 / 100
1054 ms20704 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int void solve() { int n, ans = 0; cin >> n; vector<pair<int, int>> a(n); for (auto &x : a) { cin >> x.first >> x.second; } sort(a.begin(), a.end()); for (int i = 0; i < n; i++) { int s = 0; for (int j = i; j < n; j++) { s += a[j].second; ans = max(ans, s-abs(a[i].first-a[j].first)); } } cout << ans << endl; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); int t; t = 1; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...