Submission #670540

#TimeUsernameProblemLanguageResultExecution timeMemory
670540mseebacherArt Exhibition (JOI18_art)C++17
0 / 100
0 ms212 KiB
#include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef vector<int> vi; #define MAXI (int)1e5 #define LSOne(S) ((S) & -(S)) #define MSB(S) __builtin_clz(S) vector<ll> ft; void solve(){ int n; cin >> n; vector<pair<ll,ll>> bilder; for(int i = 0;i<n;i++){ ll a,b; cin >> a >> b; bilder.push_back({a,b}); } ll maxi = 0; sort(bilder.begin(),bilder.end()); for(int i = 0;i<n;i++){ ll summe = bilder[i].second; for(int j = i+1;j<n;j++){ summe += bilder[j].second; maxi = max(summe+bilder[i].first-bilder[j].first,maxi); } } cout << maxi << "\n"; } int main(){ ios::sync_with_stdio(0); cin.tie(nullptr); cout << fixed << setprecision(8); int t = 1; //cin >> t; while(t){ solve(); t--; cout << "\n"; } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...