oj.uz

Submission #1018434

# Submission time Handle Problem Language Result Execution time Memory
1018434 2024-07-10T04:13:41 Z Bekbolot_009 Stove (JOI18_stove) C++14
100 / 100
 15 ms 3292 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define boost ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const int N = 1e6 + 12, mod = 1e16 + 7;
signed main () {
	boost
	int n, k;
	cin >> n >> k;
	k -= 1;
	vector<int>v(n + 1);
	for(int i = 1; i <= n; ++i){
		cin >> v[i];
	}
	vector<int>just;
	for(int i = 2; i <= n; ++i){
		just.push_back(v[i] - v[i - 1] - 1);
	}
	sort(just.rbegin(), just.rend());
	int cnt = 0;
	for(int i = 0; i < k; ++i){
		cnt += just[i];
	}
	cout << v[n] - v[1] - cnt + 1;
}

Subtask #1
20.0 / 20.0

# 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 0 ms 348 KB Output is correct
8 Correct 0 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 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 568 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 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 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 568 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 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 13 ms 3292 KB Output is correct
17 Correct 14 ms 3292 KB Output is correct
18 Correct 13 ms 3288 KB Output is correct
19 Correct 13 ms 3292 KB Output is correct
20 Correct 14 ms 3288 KB Output is correct
21 Correct 14 ms 3292 KB Output is correct
22 Correct 14 ms 3292 KB Output is correct
23 Correct 14 ms 3292 KB Output is correct
24 Correct 15 ms 3292 KB Output is correct