제출 #1316861

#제출 시각아이디문제언어결과실행 시간메모리
1316861exoworldgdStove (JOI18_stove)C++20
100 / 100
15 ms1984 KiB
#include<bits/stdc++.h>
#define int long long
#define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0)
using namespace std;
int n,k,t[100005],b[100005],ans;
signed main(void){
	exoworldgd;
	cin>>n>>k;
	for(int i=0;i<n;i++)cin>>t[i];
	for(int i=0;i<n-1;i++)b[i]=t[i+1]-t[i]-1;
	sort(b,b+n-1,greater<int>()),ans=t[n-1]-t[0]+1;
	for(int i=0;i<k-1&&i<n-1;i++)ans-=b[i];
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...