Submission #1258841

#	Time	Username	Problem	Language	Result	Execution time	Memory
1258841		thdh__	Art Exhibition (JOI18_art)	C++20	100 / 100	112 ms	12120 KiB

art

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define pb push_back
#define eb emplace_back
#define pu push
#define ins insert
#define bruh ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ff(x,a,b,c) for (auto x=a;x<=b;x+=c)
#define fd(x,a,b,c) for (auto x=a;x>=b;x-=c)
#define int ll

using namespace std;
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

typedef pair<int, int> ii;
const int N = 5e5+5;
const int mod = 1e9+7;
const int INF = 1e18;
using cd = complex<double>;
const long double PI = acos(-1);
int power(int a,int b) {ll x = 1;if (a >= mod) a%=mod; while (b) {if (b & 1) x = x*a % mod;a = a*a % mod;b>>=1;}return x;} 

int n;
vector<pair<int,int>> a;
int pref[N];

void solve()
{
	cin>>n; a.resize(n+1);
    for (int i=1;i<=n;i++) cin>>a[i].first>>a[i].second;
    sort(a.begin()+1,a.end());
    int mn = -a[1].first, ans = 0;
    pref[0] = 0;
    for (int i=1;i<=n;i++) pref[i] = pref[i-1] + a[i].second;
    for (int i=1;i<=n;i++)
    {
        int tmp = pref[i]-a[i].first;
        mn = min(mn,pref[i-1]-a[i].first);
        ans = max(ans,tmp-mn);
    }
    cout<<ans;
}

signed main()
{
	bruh
	//freopen("input.inp","r",stdin);
	//freopen("output.inp","w",stdout);
	int t = 1;
	//cin>>t;
	while (t--)
	{
		solve();
		cout<<"\n";
	}
}

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