oj.uz

Submission #393839

# Submission time Handle Problem Language Result Execution time Memory
393839 2021-04-24T16:30:28 Z ronnith Potatoes and fertilizers (LMIO19_bulves) C++14
0 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = (int)5e5;
int n, a[N], b[N];
long long d[N];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n;
	for(int i = 0;i < n;i ++) {
		cin >> a[i] >> b[i];
		d[i] = a[i]-b[i] + (i!=1?d[i-1]:0);
	}
	priority_queue<int> pq;
	pq.push(d[0]);
	long long ans = 0;
	for(int i = 1;i < n;i ++) {
		pq.push(d[i]);
		pq.push(d[i]);
		ans += pq.top()-d[i];
		pq.pop();
	}
	cout << ans << '\n';
	return 0;
}

Subtask #1
0 / 24.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 / 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 #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 / 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 #5
0 / 36.0

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