| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 789713 | Bula | Art Exhibition (JOI18_art) | C++17 | 392 ms | 20776 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int ll
#define f first
#define s second
const ll mod=1e9+7;
main(){
int n;
cin>>n;
vector< pair<int,int> > v(n+1);
int sum = 0;
for(int i=1;i<=n;i++){
cin>>v[i].first>>v[i].second;
sum += v[i].second;
}
sort(all(v));
int mn = INT_MAX,ans = 0,cur = 0;
for(int i=1;i<=n;i++){
mn = min(mn , cur - v[i].f);
cur += v[i].s;
ans = max(ans , cur - mn - v[i].f);
}
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... | ||||
