| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1329922 | fahim903 | Art Exhibition (JOI18_art) | C++20 | 573 ms | 31720 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin>>n;
vector<vector<ll>> a(n, vector<ll>(2, 0));
for(int i=0;i<n;i++){
cin>>a[i][0]>>a[i][1];
}
sort(a.begin(),a.end());
vector<ll> ps(n);
ps[0] = a[0][1];
for(int i = 1;i<n;i++){
ps[i] = ps[i-1] +a[i][1];
}
ll mn = -INFINITY;
ll ans = -INFINITY;
for(int i = 0;i<n;i++){
ll x = a[i][0]+a[i][1]-ps[i];
mn = max(mn,x);
ll f = ps[i]-a[i][0] + mn;
ans = max(f,ans);
}
cout<<ans<<endl;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
