제출 #1333563

#제출 시각아이디문제언어결과실행 시간메모리
1333563i271828Stove (JOI18_stove)C++20
100 / 100
39 ms2348 KiB
#include <bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
using namespace std;

const int MAX=1e5+5;

int N,K;
ll A[MAX];
vector<ll> V;

int main(){
	cin>>N>>K;
	for (int i=0;i<N;i++) cin>>A[i];
	for (int i=0;i<N-1;i++) V.push_back(A[i+1]-A[i]-1);
	sort(V.begin(),V.end(),greater<>());
	ll ans=A[N-1]-A[0]+1;
	for (int i=0;i<K-1;i++) ans-=V[i];
	cout<<ans<<'\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...