Submission #1133344

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133344		trantrungkein	Art Exhibition (JOI18_art)	C++20	100 / 100	329 ms	12088 KiB

art

#include <bits/stdc++.h>
#define int long long
#define fi           first
#define si           second
#define For(i,a,b)   for (int i = (a), _b =(b); i <= _b; ++i)
#define all(v)       v.begin(), v.end()
#define Unique(v)    v.erase(unique(all(v)), v.end())
#define MASK(i)      (1LL << (i))
#define bit(i,n)     (((n)>>(i)) & 1)
#define Vii          vector<pair<int,int>>
#define setpr(x)     cout<<setprecision(x)<<fixed
#define Prior        priority_queue< pair<int,int> , Vii, greater<Pair> >
using namespace std;

const int Mod = 1E9 + 7;
const long long INF  = 4E18;
const int N = 5e5 + 1;
int pre[N],n,k;
pair<int,int> p[N];
signed main()
{
    cin >> n;
    For(i,1,n)
    {
        cin >> p[i].fi >> p[i].si;
    }
    sort(p+1,p+n+1);
    int minn = 0,ans = -1e18;
    for(int i = 1; i <= n; i++)
    {
        pre[i] = pre[i-1] + p[i].si;
        minn = min(pre[i-1] - p[i].fi,minn);
        ans = max(ans,(pre[i]- p[i].fi - minn));
    }
    cout << ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50