# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
125620 | gs14004 | Stove (JOI18_stove) | C++17 | 27 ms | 1908 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
vector<int> v;
int main(){
int n, k, p;
scanf("%d %d %d",&n,&k,&p);
for(int i=1; i<n; i++){
int q;
scanf("%d",&q);
v.push_back(q - p - 1);
p = q;
}
sort(v.begin(), v.end());
int ans = n;
for(int i=0; i<n-k; i++) ans += v[i];
cout << ans << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |