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>
#include <iostream>
#include<queue>
#include<vector>
#include<utility>
using namespace std;
typedef long long ll;
const int sz=101;
const int sz1=2e5+1;
int n,x,k,i,j,w,m;
ll res=1e18;
ll ans=0;
int movex[4]={0,0,1,-1};
int movey[4]={-1,1,0,0};
ll c[sz1];
vector<ll>adj[sz];
ll d[sz1];
vector<array<ll,2>>a;
ll dp[sz][sz];
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>d[i];
} for(int i=2;i<=n;i++){
c[i-1]=d[i]-d[i-1];
}
sort(c+1,c+n); ans=k;
for(int i=1;i<=n-k;i++){
ans+=c[i];
} cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |