Submission #66736

#	Time	Username	Problem	Language	Result	Execution time	Memory
66736		ekrem	Art Exhibition (JOI18_art)	C++98	100 / 100	372 ms	12476 KiB

art

#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define N 1000005
using namespace std;
typedef long long ll;
ll n, ans, mx, suf[N];
pair < ll , ll > a[N];

int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%lld",&n);
	for(ll i = 1; i <= n; i++)
		scanf("%lld %lld",&a[i].st ,&a[i].nd);
	sort(a + 1, a + n + 1);
	for(ll i = n; i >= 1; i--)
		suf[i] = suf[i + 1] + a[i].nd;
	for(ll i = 1; i <= n; i++){
		mx = max(mx, suf[i] + a[i].st);
		ans = max(ans, mx - suf[i + 1] - a[i].st);
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message (stderr)

art.cpp: In function 'int main()':
art.cpp:15:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~
art.cpp:17:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&a[i].st ,&a[i].nd);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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