제출 #330225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330225		maximath_1	Stove (JOI18_stove)	C++11	100 / 100	54 ms	2028 KiB

stove

#include <iostream>
#include <vector>
#include <assert.h>
#include <random>
#include <chrono>
#include <iomanip>
#include <algorithm>
#include <set>
#include <queue>
#include <unordered_set>
using namespace std;

#define endl "\n"
#define ll long long
const ll inf = 1e9 + 69;
const int MX = 5e5 + 5;
const int LG = (int)log2(MX);
const ll mod = 1e9 + 7;
const int BLOCK = 450;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int main(){
	int n, k;
	cin >> n >> k;
	vector<int> v(n);
	for(int i = 0; i < n; i ++)
		cin >> v[i];
	vector<int> len(n - 1);
	for(int i = 0; i < n - 1; i ++)
		len[i] = v[i + 1] - v[i] - 1;
	sort(len.begin(), len.end());
	int ans = n;
	for(int i = 0; i < n - k; i ++)
		ans += len[i];
	cout << ans << endl;
}

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