Submission #542888

#	Time	Username	Problem	Language	Result	Execution time	Memory
542888		Aldas25	Art Exhibition (JOI18_art)	C++14	100 / 100	195 ms	20928 KiB

art

/*
//#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
*/

#include <bits/stdc++.h>

using namespace std;

#define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define REP(n) FOR(O, 1, (n))
#define pb push_back
#define f first
#define s second
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 500100, MAXK = 20;
const ll INF = 1e16;
//const ll MOD = 1e9+7;
//const ll MOD = 998244353;

void setIO()
{
    FAST_IO;
}

void setIO(string s)
{
    FAST_IO;
    freopen((s+".in").c_str(), "r", stdin);
    freopen((s+".out").c_str(), "w", stdout);
}

int n;
vector<pair<ll, ll>> a;

int main()
{
    setIO();

    cin >> n;
    REP(n) {
        ll x, y;
        cin >> x >> y;
        a.pb({x, y});
    }

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

    ll mn = INF;
    ll pref = 0;
    ll ans = 0;

    FOR(i, 0, n-1) {
        mn = min (mn, pref - a[i].f);
        pref += a[i].s;
        ans = max(ans, pref-a[i].f-mn);
    }

    cout << ans << "\n";

    return 0;
}

Compilation message (stderr)

art.cpp: In function 'void setIO(std::string)':
art.cpp:37:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |     freopen((s+".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:38:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     freopen((s+".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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