Submission #1105220

#TimeUsernameProblemLanguageResultExecution timeMemory
1105220sktodowArt Exhibition (JOI18_art)C++17
0 / 100
1 ms336 KiB
#include<bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; using namespace std; #define int long long #define pb push_back #define mid (l+(r-l)/2) #define f first #define s second const int N=2505; const int MOD=1e9+7; const long long inf=2e18+5; typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set; int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n; cin>>n; vector<array<int,2>>v(n+1); for(int i=1;i<=n;i++){ cin>>v[i][0]>>v[i][1]; } sort(v.begin(),v.end()); vector<int>pref(n+1,0); for(int i=1;i<=n;i++){ pref[i]=pref[i-1]+v[i][1]; } int ans=0; for(int i=1;i<n;i++){ for(int j=i;j<n;j++){ int curr=pref[j]-pref[i-1]; ans=max(ans,curr-v[j][0]+v[i][0]); } } 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...