oj.uz

Submission #503560

# Submission time Handle Problem Language Result Execution time Memory
503560 2022-01-08T10:43:39 Z BY_KUTBILIM Art Exhibition (JOI18_art) C++17
0 / 100
 0 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int N = 5e5+5;
ll n, sum, ans = -1e18, mx;
pair<int,int> a[N];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i].first >> a[i].second;
	}
	sort(a + 1, a + n + 1);
	mx = -a[1].first;
	for(int i = 1; i <= n; i++){
		sum += a[i].second;
		ans = max(ans, (sum - a[i].first) - mx);
		mx = min(mx, sum - a[i+1].first);
	}
	cout << ans;

	return 0;
}

Subtask #1
0 / 10.0

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