제출 #1220009

#제출 시각아이디문제언어결과실행 시간메모리
1220009kokoxuyaArt Exhibition (JOI18_art)C++20
100 / 100
316 ms12088 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define mp make_pair #define pii pair<int,int> #define ss second #define ff first #define piii pair<int,pii> #define debu(x) (cerr << #x << " = "<< x << "\n") #define debu2(x,y) (cerr << #x << " = "<< x << " " << #y << " = " << y << "\n") #define debu3(x,y,z) (cerr << #x << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n") #define bitout(x,y) {\ cerr << #x << " : ";\ for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\ cout << "\n";\ } #define rangeout(j,rangestart,rangeend) {\ cerr << "outputting" << #j<< ":\n";\ for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\ cerr<<"\n";\ } #define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();} #define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();} #define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();} #define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();} signed main() { int t1,t2,t3,t4; mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); //ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int n;cin>>n; vector<pii>nummys(n+1); for(int a=1;a<=n;a++) { cin>>nummys[a].ff>>nummys[a].ss; } sort(nummys.begin()+1,nummys.end()); vector<int>prefix(n+1,0); for(int a=1;a<n;a++) { int diff=(nummys[a+1].ff-nummys[a].ff); prefix[a]=prefix[a-1]+nummys[a].ss-diff; } int ans=LLONG_MIN; int mycomp=0,mymin=0; for(int a=1;a<=n;a++) { mycomp+=nummys[a].ss; mymin=min(mymin,prefix[a-1]); ans=max(ans,mycomp-mymin); if(a!=n)mycomp-=(nummys[a+1].ff-nummys[a].ff); } 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...