# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127205 | MrUnknown | Stove (JOI18_stove) | C++11 | 28 ms | 2292 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.
/***
* __ __ _ _ _
* | \/ | | | | | | |
* | \ / |_ __ | | | |_ __ | | ___ __ _____ ___ __
* | |\/| | '__| | | | | '_ \| |/ / '_ \ / _ \ \ /\ / / '_ \
* | | | | | _ | |__| | | | | <| | | | (_) \ V V /| | | |
* |_| |_|_| (_) \____/|_| |_|_|\_\_| |_|\___/ \_/\_/ |_| |_|
*
*
*/
#include<stdio.h>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for (int i=a;i<=b;i++)
#define f_(i,a,b) for (int i=a;i>=b;i--)
#define ii pair<int,int>
#define iii pair<int,ii>
#define MP make_pair
int n,a[100005],k,ans;
vector<int> v;
int main() {
// freopen("","r",stdin);
// freopen("","w",stdout);
scanf("%d %d", &n, &k);
f(i,1,n) scanf("%d", &a[i]);
if (k>=n) printf("%d", n);
else {
ans=n;
f(i,2,n) v.push_back(a[i]-a[i-1]-1);
sort(v.begin(),v.end());
f(i,1,n-k) ans+=v[i-1];
printf("%d", ans);
}
return 0;
}
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... |