Submission #1003677

#TimeUsernameProblemLanguageResultExecution timeMemory
1003677LuvidiArt Exhibition (JOI18_art)C++17
100 / 100
125 ms24772 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll, ll> #define pii pair<int, int> #define fs first #define sc second #define pb push_back void solve() { int n; cin>>n; pll a[n]; for(pll &p:a)cin>>p.fs>>p.sc; sort(a,a+n); ll pre[n+1]; pre[0]=0; for(int i=1;i<=n;i++)pre[i]=pre[i-1]+a[i-1].sc; ll x=1e18,ans=0; for(int i=0;i<n;i++){ x=min(x,pre[i]-a[i].fs); ans=max(ans,pre[i+1]-a[i].fs-x); } cout<<ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...