Submission #526085

#	Time	Username	Problem	Language	Result	Execution time	Memory
526085		benjaminkleyn	Art Exhibition (JOI18_art)	C++17	100 / 100	178 ms	20680 KiB

art

    #pragma GCC optimize("O3")
    #pragma GCC optimize("unroll-loops")
    #pragma GCC target("avx,avx2,fma")
    #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;

    void solve()
    {
        int n;
        cin >> n;
        vector<pair<ll,ll>> p(n);
        for (int i = 0; i < n; i++)
            cin >> p[i].first >> p[i].second;
        sort(p.begin(), p.end());

        ll S = 0, ans = 0;
        for (int i = 0; i < n; i++)
        {
            S = max(S + p[i].second, p[i].first + p[i].second);
            ans = max(ans, S - p[i].first);
        }

        cout << ans << '\n';
    }

    int main()
    {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);

        solve();

        return 0;
    }

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