oj.uz

Submission #1088492

# Submission time Handle Problem Language Result Execution time Memory
1088492 2024-09-14T14:02:35 Z Staheos Stove (JOI18_stove) C++14
100 / 100
 39 ms 2420 KB 
#include <iostream>
#include <queue>

using namespace std;

int main()
{
	int n, k;
	cin >> n >> k;
	int s = n;

	int* t = new int[n];
	for (int i = 0; i < n; i++)
	{
		cin >> t[i];
	}

	auto q = priority_queue<int>();
	for (int i = 1; i < n; i++)
	{
		if (t[i - 1] != t[i] - 1)
		{
			q.push(t[i] - t[i - 1] - 1);
		}
	}

	k--;
	while (k > 0 && !q.empty())
	{
		q.pop();
		k--;
	}

	while (!q.empty())
	{
		s += q.top();
		q.pop();
	}

	cout << s << '\n';
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 33 ms 2264 KB Output is correct
17 Correct 35 ms 2264 KB Output is correct
18 Correct 35 ms 2420 KB Output is correct
19 Correct 34 ms 2252 KB Output is correct
20 Correct 35 ms 2264 KB Output is correct
21 Correct 37 ms 2260 KB Output is correct
22 Correct 39 ms 2352 KB Output is correct
23 Correct 35 ms 2252 KB Output is correct
24 Correct 34 ms 2252 KB Output is correct