Submission #1281104

#	Time	Username	Problem	Language	Result	Execution time	Memory
1281104		KickingKun	Art Exhibition (JOI18_art)	C++20	100 / 100	133 ms	12112 KiB

art

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define ld long double
#define bigint __int128
#define emb emplace_back
#define pb push_back
#define pii pair <int, int>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define Task ""

#define MASK(k) (1ull << k)
#define bitcnt(k) __builtin_popcount(k)
#define testBit(n, k) ((n >> k) & 1)
#define flipBit(n, k) (n ^ (1ll << k))
#define offBit(n, k) (n & ~MASK(k))
#define onBit(n, k) (n | (1ll << k))

template <class T> bool minimize(T &a, T b) {if (a > b) {a = b; return true;} return false;}
template <class T> bool maximize(T &a, T b) {if (a < b) {a = b; return true;} return false;}

const int N = 5e5 + 5, lim = 60, mod = 1e9 + 7;
const ll INF = 1e18;

int n; ll s[N];
pair <ll, int> p[N];

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

	if (fopen(Task".inp", "r")) {
		freopen(Task".inp", "r", stdin);
		freopen(Task".out", "w", stdout);
	}

	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> p[i].fi >> p[i].se;
	sort (p + 1, p + n + 1);

	for (int i = 1; i <= n; i++)
		s[i] = s[i - 1] + p[i].se;

	ll ans = 0, ma = -INF;
	for (int i = 1; i <= n; i++) {
		maximize(ma, p[i].fi - s[i - 1]);
		maximize(ans, s[i] - p[i].fi + ma);
	}
	cout << ans;
}

Compilation message (stderr)

art.cpp: In function 'int main()':
art.cpp:36:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |                 freopen(Task".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
art.cpp:37:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |                 freopen(Task".out", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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