제출 #1014232

#제출 시각아이디문제언어결과실행 시간메모리
1014232marArt Exhibition (JOI18_art)C++14
100 / 100
363 ms25520 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 1e7; #define f first #define s second; pair<ll,ll>p[maxn]; ll ps[maxn]; int main() { int n; cin>>n; for(int i =0; i < n; i++) { cin>>p[i].f>>p[i].s; } sort(p,p+n); ps[0]=p[0].s; for(int i =1; i<=n; i++) { ps[i]=ps[i-1]+p[i].s; } ll maxi=0; ll ans =0; for(int i=0; i<n; i++){ maxi = max(maxi, p[i].f-ps[i-1]); ans = max(ans, ps[i]-p[i].f + maxi); } cout<<ans<<endl; 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...