제출 #1283668

#제출 시각아이디문제언어결과실행 시간메모리
1283668ngodangminhArt Exhibition (JOI18_art)C++20
100 / 100
134 ms16708 KiB
#include <bits/stdc++.h> #define fi first #define se second using namespace std; using ll = long long ; ll n,ans,tong; vector<ll>x; pair<ll,ll> p[500005]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n; for(int i=1;i<=n;i++) cin>>p[i].fi>>p[i].se; sort(p+1,p+n+1); x.push_back(p[1].se); for(int i=2;i<=n;i++) { x.push_back(p[i-1].fi-p[i].fi); x.push_back(p[i].se); } for(int i=0;i<x.size();i++) { tong+=x[i]; if(tong<0) tong=0; ans=max(ans,tong); } 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...