# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1017823 |
2024-07-09T10:30:20 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
1 ms |
344 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] - cnt;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |