oj.uz

Submission #203278

# Submission time Handle Problem Language Result Execution time Memory
203278 2020-02-20T05:03:09 Z dolphingarlic Potatoes and fertilizers (LMIO19_bulves) C++14
0 / 100
 6 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;

long long c[500001], ans = 0;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		long long a, b;
		cin >> a >> b;
		c[i] = c[i - 1] + a - b;
	}
	priority_queue<long long> pq;
	for (int i = 1; i <= n; i++) {
		if (c[i] > c[n]) {
			ans += c[i] - c[n];
			c[i] = c[n];
		} else if (c[i] < 0) ans -= c[i];
		pq.push(c[i]); pq.push(c[i]);
		ans += pq.top() - c[i];
		pq.pop();
	}
	cout << ans;
	return 0;
}

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Incorrect 6 ms 376 KB Output isn't correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Incorrect 6 ms 376 KB Output isn't correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Incorrect 5 ms 376 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Incorrect 6 ms 376 KB Output isn't correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Incorrect 6 ms 376 KB Output isn't correct