# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110076 | maruii | Stove (JOI18_stove) | C++14 | 31 ms | 2176 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;
int N, K;
int A[100001], B[100001];
int main(){
scanf("%d%d",&N,&K);
for(int i=0; i<N; ++i)
scanf("%d",A+i);
for(int i=0; i<N-1; ++i)
B[i] = A[i+1]-A[i];
sort(B, B+N-1);
int ans = accumulate(B, B+N-K, 0);
printf("%d",ans+K);
}
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... |