# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
571776 | Huy | Art Exhibition (JOI18_art) | C++17 | 207 ms | 20784 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 int long long
#define pii pair<ll,ll>
#define fi first
#define se second
using namespace std;
using ll = long long;
using ldb = long double;
const int N = (int)1e8;
const int maxN = (int)5e5 + 5;
const int mod = 1e9 + 7;
const ll infty = 1e18;
void InputFile()
{
//freopen("scrivener.inp","r",stdin);
//freopen("scrivener.out","w",stdout);
freopen("test.out","r",stdin);
}
void FastInput()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
}
int n,m;
pii x[maxN];
ll mini = infty;
ll sum = 0;
ll res = 0;
void Read()
{
cin >> n;
for(int i = 1;i <= n;i++)
{
cin >> x[i].fi >> x[i].se;
}
sort(x + 1,x + n + 1);
mini = min(mini,sum - x[1].fi);
for(int i = 1;i <= n;i++)
{
sum += x[i].se;
res = max(res,sum - mini - x[i].fi);
mini = min(mini,sum - x[i+1].fi);
}
cout << res;
}
void Solve()
{
}
void Debug()
{
//Main_sub();
//Naive();
}
int32_t main()
{
FastInput();
//InputFile();
//int sub_type;
//cin >> sub_type;
//Sieve();
int test;
//cin >> test;
test = 1;
while(test--)
//for(int prc = 1; prc <= test; prc++)
{
Read();
Solve();
//Debug();
}
}
/*
4 1
1 1 1 1
1 2
2 3
3 4
*/
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... |