Submission #461060

#	Time	Username	Problem	Language	Result	Execution time	Memory
461060		TeaTime	Art Exhibition (JOI18_art)	C++17	0 / 100	0 ms	204 KiB

art

#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <unordered_map>

using namespace std;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

typedef long long ll;
typedef long double ld;

const ll SZ = 2e5 + 100, INF = 1e9 + 10, MX = 4e5 + 210;

vector<pair<ll, ll>> vec;
ll n;

int main() {
    fastInp;

    cin >> n;

    vec.resize(n);
    for (auto& c : vec) cin >> c.first >> c.second;

    sort(vec.begin(), vec.end());

    ll mxsum = vec[0].second, cur = vec[0].second;
    for (int i = 1; i < n; i++) {
        cur += vec[i].second;
        cur -= (vec[i].first - vec[i - 1].first);
        mxsum = max(mxsum, cur);
        if (cur < 0) cur = vec[i].second;
    }

    cout << mxsum;

    return 0;
}

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