제출 #206279

#제출 시각아이디문제언어결과실행 시간메모리
206279lucky_c25Art Exhibition (JOI18_art)C++11
0 / 100
5 ms380 KiB
#include<bits/stdc++.h> #define maxn 500010 using namespace std; long long int maxx[maxn],p[maxn]; pair<long long int,int> s[maxn]; int main() { int n; cin>>n; for(int i = 1;i<=n;i++) cin>>s[i].first>>s[i].second; sort(s+1,s+n+1); long long int suma = 0; for(int i = 0;i<n;i++){ suma+=s[i].second; p[i] = suma; } for(int i = 1;i<=n;i++){ maxx[i] = max(maxx[i-1],s[i].first-p[i-1]); } long long int res = 0; for(int i = 1;i<=n;i++){ res = max(res,p[i]-s[i].first+maxx[i]); } cout<<res; 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...