Submission #1049765

#	Time	Username	Problem	Language	Result	Execution time	Memory
1049765		vjudge1	Art Exhibition (JOI18_art)	C++17	50 / 100	1070 ms	19896 KiB

art

#include <bits/stdc++.h>

#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,lzcnt,mmx,abm,avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math,inline")

using namespace std;

#define speed ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define vc vector
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define int ll

const int N = 5e5 + 5;
const int M = 5e5 + 5;
const int mod = 1e9 + 7;
const int block = 500;

int n;
ll a[N], b[N], pref[N];

void solve() {
	cin >> n;
    vc <pair<ll,ll>> save;
    for ( int i = 1; i <= n; i++ ) {
        cin >> a[i] >> b[i];
        save.pb(mp(a[i],b[i]));
    }
    sort(all(save));
    for ( int i = 1; i <= n; i++ ) {
        pref[i] = pref[i-1] + save[i-1].se;
    }
    ll ans = 0;
    for ( int i = 1; i <= n; i++ ) {
        for ( int j = 1; j <= i; j++ ) {
            ans = max(ans,(pref[i]-pref[j-1])-(save[i-1].fi-save[j-1].fi));
        }
    }
    cout << ans;
}

signed main() {
	speed;
	int tt;
	//cin >> tt;
    tt = 1;
	while ( tt-- ) {
		solve();
		cout << '\n';
	}
}

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