oj.uz

Submission #202337

# Submission time Handle Problem Language Result Execution time Memory
202337 2020-02-15T14:02:21 Z someone_aa Art Exhibition (JOI18_art) C++17
0 / 100
 5 ms 256 KB 
#include <bits/stdc++.h>
#define ll long long 
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 500100;
vector<pair<ll,ll> > v;
ll pref[maxn], n;

int main() {
	cin>>n;
	ll a, b;
	for(int i=1;i<=n;i++) {
		cin>>a>>b;
		v.pb({a, b});
	} sort(v.begin(), v.end());

	ll maxv = v[0].first;
	ll result = 0LL;
	for(int i=1;i<=n;i++) {
		pref[i] = pref[i-1] + v[i-1].second;
		result = max(result, pref[i] - v[i-1].first + maxv);
		maxv = max(maxv, v[i-1].first - pref[i-1]);
	}
	cout<<result<<"\n";
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -