Submission #708638

#	Time	Username	Problem	Language	Result	Execution time	Memory
708638		myrcella	Stove (JOI18_stove)	C++17	100 / 100	21 ms	1368 KiB

stove

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

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

const int maxn = 100010;

int n,m;
vector <int> dif;

int main() {
//	freopen("input.txt","r",stdin);	
	std::ios::sync_with_stdio(false);cin.tie(0);
	cin>>n>>m;
	int lst;
	int ans = 0;
	rep(i,0,n) {
		int cur;cin>>cur;
		if (i!=0) dif.pb(cur-lst-1);
		lst = cur;
		if (i==0) ans=-cur;
		if (i==n-1) ans+=cur+1;
	}
	sort(ALL(dif));
	rep(i,1,m) {
		ans-=dif.back();
		dif.pop_back();
	}
	cout<<ans;
	return 0;
}

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