제출 #1246922

#제출 시각아이디문제언어결과실행 시간메모리
1246922yoshiArt Exhibition (JOI18_art)C++20
100 / 100
364 ms12084 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long #define ss second #define ff first ll i,j; int main(){ ll n; cin>>n; vector<pair<ll,ll>> a(n); for(i=0; i<n; i++){ cin>>a[i].ff>>a[i].ss; } sort(a.begin() , a.end()); ll b[n]; b[0]=a[0].ss; for( i=1; i<n; i++){ b[i]=max(a[i].ss , b[i-1]+a[i].ss- ( a[i].ff- a[i-1].ff)); } ll ans=0; for(ll i=0; i<n; i++){ ans=max(b[i],ans); } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...