Submission #1071210

#	Time	Username	Problem	Language	Result	Execution time	Memory
1071210		vjudge1	Art Exhibition (JOI18_art)	C++17	50 / 100	1079 ms	20804 KiB

art

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;

#define fs first
#define sc second
pair<ll, ll> arr[500005];
ll n;

bool cmp(pair<ll, ll> a, pair<ll, ll> b) {
	return a.first < b.first;
}

int main() {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> arr[i].first >> arr[i].second;
	}

	sort(arr + 1, arr + n + 1, cmp);
	pair<ll, ll> tmp;
	ll ans = 0;
	for (int i = 1; i <= n; ++i) {
		tmp = { 0, 0 };
		for (int j = i; j <= n; ++j) {
			tmp.fs = arr[j].fs;
			tmp.sc += arr[j].sc;
			ans = max(ans, tmp.sc - tmp.fs + arr[i].fs);
		}
	}
	cout << ans;
        return 0;
}

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