# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1273278 | nlhuy | Art Exhibition (JOI18_art) | C++20 | 124 ms | 8260 KiB |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define Task "test"
typedef pair<ll,ll>ii;
const int MOD = 1e9+7;
const int INF = 1e9+7;
const int Maxn = 5e5+7;
const int di[] = {0, 0, -1, 1};
const int dj[] = {-1, 1, 0, 0};
ii a[Maxn];
void run_case(){
int n;
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i].fi>>a[i].se;
sort(a+1,a+n+1);
ll Min=INF;
ll ans=0,sum=0;
for(int i=1;i<=n;i++){
Min=min(Min,sum-a[i].fi);
sum+=a[i].se;
ans=max(ans,sum-a[i].fi-Min);
}
cout<<ans;
}
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
if (fopen(Task ".inp", "r"))
{
freopen(Task ".inp", "r", stdin);
freopen(Task ".out", "w", stdout);
}
int t = 1;
//cin >> t;
while(t--){
run_case();
}
}
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... |