# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76858 | Vardanyan | Stove (JOI18_stove) | C++14 | 3 ms | 764 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;
const int N = 5007;
long long a[N];
long long dif[N];
int main(){
int n,k;
scanf("%d%d",&n,&k);
for(int i = 1;i<=n;i++){
scanf("%lld",&a[i]);
if(i>1) dif[i] = a[i]-a[i-1];
}
sort(dif+1,dif+1+n);
reverse(dif+1,dif+1+n);
long long c = 0;
for(int i = 1;i<=k-1;i++)c+=dif[i];
c = a[n]-a[1]+k-c;
printf("%lld\n",c);
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... |