# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1108490 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 134 ms | 8520 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>
#define ll long long
#define pii pair < ll , ll >
#define fi first
#define se second
using namespace std;
const int N = 5e5;
int n;
pii a[N + 5];
ll res = 0 , maxvl;
void init()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if(fopen("shopping2.INP" , "r"))
{
freopen("shopping2.INP" , "r" , stdin);
freopen("shopping2.OUT" , "w" , stdout);
}
}
int power(ll a , ll b , ll mod)
{
ll ans = 1;
while(b)
{
if(b & 1) ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
int main()
{
init();
cin >> n;
for(int i = 1 ; i <= n ; i ++)
{
cin >> a[i].fi >> a[i].se;
res = max(res , a[i].se);
}
sort(a + 1 , a + n + 1);
ll sum = a[1].se;
maxvl = a[1].fi;
for(int i = 2 ; i <= n ; i ++)
{
sum += a[i].se;
res = max(res , sum - a[i].fi + maxvl);
maxvl = max(maxvl , a[i].fi - sum + a[i].se);
}
cout << res;
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... |