Submission #1278104

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278104		daniyar228	Art Exhibition (JOI18_art)	C++20	100 / 100	128 ms	12100 KiB

art

#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using pii = pair<i64, i64>;
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
const int N = 500'000, inf = 1'000'000'000;
const i64 infl = 1'000'000'000'000'000'000;
const int mod1 = 1'000'000'009, mod2 = 998'244'353;
const int p1 = 31, p2 = 37;
#define ff first
#define ss second
#define pb push_back
#define ins insert
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define NO cout << "NO\n"
#define YES cout << "YES\n"
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int __tc = 1;
void solve() {
    i64 n, mn = 0, ans = 0;
    cin >> n;
    pii a[n+5];
    for (int i = 1; i <= n; i++) cin >> a[i].ff >> a[i].ss;
    for (int i = 1; i <= n; i++) ans = max(ans, a[i].ss);
    sort(a+1,a+n+1);
    i64 p[n+5]; 
    p[0] = 0;
    for (int i = 1; i <= n; i++) p[i] = p[i-1] + a[i].ss;
    for (int i = 1; i <= n; i++) {
        ans = max(ans, p[i] - a[i].ff - mn);
        mn = min(mn, p[i-1] - a[i].ff);
    }
    cout << ans;
}
int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    // cin >> __tc;
    for (int _tc = 1; _tc <= __tc; _tc++) {
        solve();
    }
}

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