Submission #1165782

#	Time	Username	Problem	Language	Result	Execution time	Memory
1165782		GoBananas69	Art Exhibition (JOI18_art)	C++20	0 / 100	0 ms	320 KiB

art

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
typedef long long ll;
using namespace std;

int main() {
    ll n;
    cin >> n;
    vector<pair<int, int>> nums(n + 1);
    vector<int> pref(n + 1, 0);
    for (auto &p: nums) {
        cin >> p.first >> p.second;
    }
    sort(nums.begin(), nums.end());
    for (int i = 1; i<=n; ++i) {
        pref[i] = pref[i - 1] + nums[i].second;
    }
    int a = 0;
    int b = 0;
    int res = 0;
    for (int i = 1; i<=n; ++i) {
        a = pref[i] - nums[i].first;
        b = max(b, nums[i].first - pref[i - 1]);
        res = max(res, a + b);
    }
    cout << res << '\n';
}

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