제출 #765971

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
765971		dhanesanjay123	Stove (JOI18_stove)	C++14	100 / 100	45 ms	3500 KiB

stove

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pll pair<ll, ll>
#define pb push_back
#define bp pop_back
#define ades ios_base::sync_with_stdio(false); cin.tie(NULL);

ll N, M, a[100010], ans;
bool bener[100010];
pair<ll, ll> ada[100010];

int main(){
	cin >> N >> M;
	for(int i = 1; i<= N; i++){
		cin >> a[i];
	}
	for(int i = 1; i< N; i++){
		ada[i].fi = a[i+1]-a[i]; 
		ada[i].se = i;
	}
	sort(ada+1, ada+N);
	if(N <= M){
//		for(int i = 1; i< N; i++){
//			if(a[i] == a[i+1]){
//				ans++;
//			}
//			else{
//				ans++;
//			}
//		}
		cout << N << endl;
		return 0;
	}
	for(int i = 1; i<= N-M; i++){
		bener[ada[i].se] = true;
//		cout << ada[i].se << endl;
	}
	for(int i = 1; i<= N; i++){
		if(bener[i]){
			ans += a[i+1]-a[i];
		}
		else{
			ans++;
		}
	}
	cout << ans << endl;
}

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