oj.uz

Submission #534907

# Submission time Handle Problem Language Result Execution time Memory
534907 2022-03-09T06:20:43 Z amunduzbaev Art Exhibition (JOI18_art) C++17
0 / 100
 1 ms 332 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array
#define int long long
const int N = 5e5 + 5;
ar<int, 2> a[N];
int pref[N];

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n; cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i][0]>>a[i][1];
	}
	
	sort(a+1, a+n+1, [&](ar<int, 2>& a, ar<int, 2>& b){
		return (a[0] < b[0]);
	});
	//~ for(int i=1;i<=n;i++) cout<<a[i][0]<<" "<<a[i][1]<<"\n";
	for(int i=1;i<=n;i++) pref[i] = pref[i-1] + a[i][1];
	
	int mx = -1e18, res = -1e18;
	for(int i=1;i<=n;i++){
		res = max(res, pref[i] - a[i][0] + mx);
		mx = max(mx, a[i][0] - pref[i-1]);
	}
	
	cout<<res<<"\n";
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 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 332 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 332 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 332 KB Output isn't correct
2 Halted 0 ms 0 KB -