oj.uz

Submission #1115276

# Submission time Handle Problem Language Result Execution time Memory
1115276 2024-11-20T09:44:33 Z staszic_ojuz Stove (JOI18_stove) C++17
100 / 100
 26 ms 2260 KB 
#include <iostream>
#include <queue>

using namespace std;

const int MAXN = 100004;

int n, l;

int tablica[MAXN];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> l;
	
	for (int i = 0; n > i; i++) {
		cin >> tablica[i];
	}
	
	int wynik = tablica[n - 1] - tablica[0] + 1;
	l--;
	
	priority_queue<int> kopiec;
	
	for (int i = 1; n > i; i++) {
		kopiec.push(tablica[i] - tablica[i - 1]);
	}
	while (l) {
		wynik -= kopiec.top();
		wynik++;
		kopiec.pop();
		l--;
	}
	cout << wynik;
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 508 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 508 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 504 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 508 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 508 KB Output is correct
3 Correct 1 ms 508 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 504 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 2 ms 508 KB Output is correct
16 Correct 11 ms 2260 KB Output is correct
17 Correct 12 ms 2196 KB Output is correct
18 Correct 12 ms 2144 KB Output is correct
19 Correct 12 ms 2260 KB Output is correct
20 Correct 15 ms 1492 KB Output is correct
21 Correct 19 ms 1780 KB Output is correct
22 Correct 26 ms 1492 KB Output is correct
23 Correct 20 ms 1996 KB Output is correct
24 Correct 19 ms 1492 KB Output is correct