Submission #941814

# Submission time Handle Problem Language Result Execution time Memory
941814 2024-03-09T13:25:04 Z mannshah1211 Stove (JOI18_stove) C++17
100 / 100
18 ms 2464 KB
/**
 *   author: hashman
 *   created: 
**/
#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif

int32_t main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, k;
	cin >> n >> k;
	vector<int> t(n);
	for (int i = 0; i < n; i++) {
		cin >> t[i];
	}
	vector<int> differences;
	for (int i = 0; i < n - 1; i++) {
		assert(t[i] < t[i + 1]);
		differences.push_back(t[i + 1] - t[i] - 1);
	}
	sort(differences.begin(), differences.end());
	reverse(differences.begin(), differences.end());
	long long ans = t[n - 1] - t[0] + 1;
	for (int i = 0; i < k - 1; i++) {
		ans -= 1LL * differences[i];
	}
	cout << ans << '\n';
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 420 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 496 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 420 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 496 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 15 ms 2272 KB Output is correct
17 Correct 18 ms 2272 KB Output is correct
18 Correct 15 ms 2464 KB Output is correct
19 Correct 18 ms 2272 KB Output is correct
20 Correct 15 ms 2272 KB Output is correct
21 Correct 18 ms 2256 KB Output is correct
22 Correct 16 ms 2272 KB Output is correct
23 Correct 15 ms 2368 KB Output is correct
24 Correct 15 ms 2384 KB Output is correct