| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1312635 | coderg | Art Exhibition (JOI18_art) | C++20 | 133 ms | 8260 KiB |
#include "bits/stdc++.h"
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define pb push_back
void setIO(string name = ""){if(name.size()){ freopen((name + ".in").c_str(), "r", stdin);freopen((name + ".out").c_str(), "w", stdout);}}
#define F(i,l,r) for(int i=(l);i<(r);++i)
#define FR(i,l,r) for(int i=(l);i>=(r);--i)
typedef long long ll;
const int maxn=100005;
const int mod=1e9+7;
const int mox=2000*500+505;
const int inf=1e9;
struct Artwork{
ll siz,val;
};
bool cmp(const Artwork& a,const Artwork& b){
if(a.siz!=b.siz)return a.siz<b.siz;
return a.val<b.val;
}
void solve(){
int n;
cin>>n;
vector<Artwork> a(n);
F(i,0,n)cin>>a[i].siz>>a[i].val;
sort(a.begin(),a.end(),cmp);
ll curpref=0,mx=-2e18,ans=-2e18;
F(i,0,n){
ll cura=a[i].siz,curb=a[i].val;
ll potential=cura-curpref;
mx=max(mx,potential);
curpref+=curb;
ll term=curpref-cura,cur=term+mx;
ans=max(ans,cur);
}
cout<<ans<<'\n';
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(nullptr);
int tt=1;
// cin>>tt;
while(tt--)solve();
return 0;
}
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... | ||||
