Submission #699287

#TimeUsernameProblemLanguageResultExecution timeMemory
699287youssefArt Exhibition (JOI18_art)C++17
0 / 100
0 ms212 KiB
/* ██╗░░░██╗░█████╗░██╗░░░██╗░██████╗░██████╗███████╗███████╗ ╚██╗░██╔╝██╔══██╗██║░░░██║██╔════╝██╔════╝██╔════╝██╔════╝ ░╚████╔╝░██║░░██║██║░░░██║╚█████╗░╚█████╗░█████╗░░█████╗░░ ░░╚██╔╝░░██║░░██║██║░░░██║░╚═══██╗░╚═══██╗██╔══╝░░██╔══╝░░ ░░░██║░░░╚█████╔╝╚██████╔╝██████╔╝██████╔╝███████╗██║░░░░░ ░░░╚═╝░░░░╚════╝░░╚═════╝░╚═════╝░╚═════╝░╚══════╝╚═╝░░░░░ */ #include <bits/stdc++.h> using namespace std; #define nl "\n" #define ll long long #define fi first #define se second #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector<pair<ll,ll>>art; int n=0; ll sofva=0; ll N=LONG_LONG_MIN; ll ma=N; int re(int i,ll sum) { for(int j=n-1;j>i;j--) { ll r=art[j].fi-art[i].fi; ma=max(ma,sum-r); sum-=art[j].se; } return 0; } int main() { fast cin>>n; for(int i=0;i<n;i++) {ll siz,va; cin>>siz>>va; art.push_back({siz,va}); sofva+=va; } sort(art.begin(),art.end()); ll h=sofva; for(int i=0;i<n-1;i++) { re(i,h); h-=art[i].se; } cout<<ma; 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...