oj.uz

Submission #471286

# Submission time Handle Problem Language Result Execution time Memory
471286 2021-09-08T08:15:04 Z IvnF Art Exhibition (JOI18_art) C++14
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ull unsigned long long
#define fi first
#define se second
#define ld long double
ll n, pref[500005];
pair<ll, ll>arr[500005];

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n;
	for(int i=1;i<=n;++i){
		cin >> arr[i].fi >> arr[i].se;
	}
	sort(arr+1, arr+1+n);
	for(int i=1;i<=n;++i) pref[i]=pref[i-1]+arr[i].se;
	ll l=1, maks=0;
	for(int i=1;i<=n;++i){
		while((pref[i]-pref[l-1])-(arr[i].fi-arr[l].fi) < 0){
			++l;
		}
		maks=max(maks, (pref[i]-pref[l-1])-(arr[i].fi-arr[l].fi));
	}
	cout << maks << '\n';
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 50.0

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