Submission #1033849

#TimeUsernameProblemLanguageResultExecution timeMemory
1033849kustizusArt Exhibition (JOI18_art)C++17
100 / 100
153 ms24916 KiB
// #pragma GCC optimize("O3,unroll-loops") // #pragma GCC target("avx2,fma,bmi2,popcnt,lzcnt") #include <bits/stdc++.h> #define int long long using namespace std; mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count()); const int N=5e5; int n,pre[N+5]; pair <int,int> a[N+5]; void Solve(){ cin>>n; for (int i=1;i<=n;++i) cin>>a[i].first>>a[i].second; sort(a+1,a+n+1); int mx=-a[1].first,ans=-1e18; for (int i=1;i<=n;++i){ pre[i]=pre[i-1]+a[i].second; ans=max(ans,pre[i]-a[i].first-mx); mx=min(mx,pre[i]-a[i+1].first); } cout<<ans; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); // freopen ("FILE.INP","r",stdin); // freopen ("FILE.OUT","w",stdout); int t=1; while (t--) Solve(); cerr<<"\nTIME: "<<1000*clock()/CLOCKS_PER_SEC<<"ms\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...