제출 #1290456

#제출 시각아이디문제언어결과실행 시간메모리
1290456amodiArt Exhibition (JOI18_art)C++20
0 / 100
0 ms332 KiB
//#pragma GCC target("tune=native") //#pragma GCC optimize("03,inline,Ofast,unroll-loops") #include <bits/stdc++.h> using namespace std; #define int long long vector<vector<int>>adj; int32_t main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n; cin>>n; vector<pair<int,int>> a(n); int toplam=0; for(int i=0;i<n;i++)cin>>a[i].first>>a[i].second; sort(a.begin(),a.end()); int pref[n+1]; memset(pref,0,sizeof(pref)); for(int i=1;i<=n;i++) { pref[i]+=a[i-1].second+pref[i-1]; } int ans=-1e15; int mn=0-a[0].first; for(int r=1;r<=n;r++){ ans=max(ans,pref[r]-a[r-1].first-mn); mn=min(mn,pref[r-1]-a[r-1].first); } 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...