제출 #1290540

#제출 시각아이디문제언어결과실행 시간메모리
1290540osman_avci42Stove (JOI18_stove)C++20
0 / 100
1 ms568 KiB
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define int long long
using namespace std;
string s,ses;
int n,m,x,y,z,sat[200005],b[200005];
int32_t main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>m;
	z=10000000005;
	for(int i=1;i<=n;i++){
		cin>>sat[i];
		z=min(z,sat[i]);
		y=max(y,sat[i]);
		if(i!=1){
			b[i]=(sat[i]-sat[i-1])-1;
		}
	}
	sort(b+1,b+n+1);
	z=n-z+1;
	for(int i=1;i<=m-1;i++){
		y-=b[z];
		z--;
	}
	cout<<y;
	return 0;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...