Submission #1203732

#TimeUsernameProblemLanguageResultExecution timeMemory
1203732chawinknArt Exhibition (JOI18_art)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h> using namespace std; #define f first #define s second #define ll long long ll qs[5009]; 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()); for (int i = 1; i <= n; i++) qs[i] = qs[i-1]+a[i-1].s; ll ans=0; for (int i = 0; i < n; i++) for (int j = i+1; j < n; j++) ans = max(ans, qs[j+1]-qs[i]-a[j].f+a[i].f); 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...