Submission #964514

#	Time	Username	Problem	Language	Result	Execution time	Memory
964514		UmairAhmadMirza	Stove (JOI18_stove)	C++17	100 / 100	47 ms	2412 KiB

stove

#include <bits/stdc++.h>
using namespace std;

#define ll long long
int const N=2e5+5;
int const mod=1e9+7;

void solve(){
	int n,k;
	cin>>n>>k;
	k--;
	int arr[n];
	for(int i=0;i<n;i++)
		cin>>arr[i];
	sort(arr,arr+n);
	vector<int> d;
	int ans=1+(arr[n-1]-arr[0]);
	for(int i=0;i<n-1;i++)
		d.push_back((arr[i+1]-arr[i])-1);
	sort(d.begin(), d.end());
	reverse(d.begin(), d.end());
	for(int i=0;i<min(k,n-1);i++)
		ans-=d[i];
	cout<<ans<<endl;
}

int main(){
	int t=1;
	// cin>>t;
	while(t--)
		solve();
	return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50