Submission #284357

#	Time	Username	Problem	Language	Result	Execution time	Memory
284357		ronnith	Stove (JOI18_stove)	C++14	0 / 100	1 ms	384 KiB

stove

#include <bits/stdc++.h>
#define boost_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2(a,b) debug(a);debug(b)
#define debug3(a,b,c) debug2(a,b);debug(c)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/(__gcd(a,b))
#define print(arr) for(auto it = arr.begin();it < arr.end();it ++){cout << *it << " ";}cout << ln;
#define all(a) (a).begin(), (a).end()
#define vi vector<long long>
#define v vector
#define p pair
#define pb push_back
#define mk make_pair
#define f first
#define s second
#define ln "\n"
typedef long double ld;
typedef double d;
using namespace std;
int modF=1e9+7;
int INF=1e11;

void solve(){
	int n,k;
	cin>>n>>k;
	v<p<int,int>> hv;
	int st;
	int l=0;
	int mc=n;
	rep(i,0,n){
		cin>>st;
		hv.pb(mk(st,1));
		hv.pb(mk(st+1,0));
		l+=2;
	}
	sort(all(hv));
	vi gap;
	int ans=0;
	rep(i,1,l){
		if(hv[i].s==1){
			ans+=hv[i].f-hv[i-1].f;
		}
		else{
			gap.pb(hv[i].f-hv[i-1].f);
		}
	}
	sort(all(gap));
	int h=0;
	while(mc>k){
		ans+=gap[h];
		h++;
		mc--;
	}
	cout<<ans<<ln;
}

signed main(){
	boost_io;
	solve();
	return 0;
}

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