# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
991647 |
2024-06-02T17:47:23 Z |
Uniq0rn |
Stove (JOI18_stove) |
C++14 |
|
0 ms |
348 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) begin(x),end(x)
#define pb push_back
#define sz(x) (int)x.size()
#define s second
#define f first
int main() {
cin.tie(0)->sync_with_stdio(0);
int n,k;cin >> n >> k;
vector<int> a(n),dif;
for(auto &e:a) cin >> e;
for(int i=1;i<n;i++){
dif.push_back(a[i]-a[i-1]+1);
}
sort(all(dif));
int ans = 0;
for(int i=0;i<n-k;i++){
ans+=dif[i];
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |