Submission #853158

# Submission time Handle Problem Language Result Execution time Memory
853158 2023-09-23T14:17:46 Z parsadox2 Stove (JOI18_stove) C++14
100 / 100
22 ms 2272 KB
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
int n , k , ar[N];

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);  cout.tie(0);
	cin >> n >> k;  k--;
	for(int i = 0 ; i < n ; i++)
		cin >> ar[i];
	priority_queue <int> pq;
	int ans = ar[n - 1] - ar[0] + 1;
	for(int i = 1 ; i < n ; i++)
		pq.push(ar[i] - ar[i - 1] - 1);
	while(k--)
	{
		ans -= pq.top();
		pq.pop();
	}
	cout << ans << '\n';
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 10 ms 2268 KB Output is correct
17 Correct 9 ms 2272 KB Output is correct
18 Correct 10 ms 2268 KB Output is correct
19 Correct 10 ms 2268 KB Output is correct
20 Correct 14 ms 2268 KB Output is correct
21 Correct 18 ms 2272 KB Output is correct
22 Correct 22 ms 2268 KB Output is correct
23 Correct 22 ms 2268 KB Output is correct
24 Correct 19 ms 2268 KB Output is correct