제출 #387553

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
387553		idontreallyknow	Stove (JOI18_stove)	C++17	100 / 100	57 ms	6760 KiB

stove

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class A> ostream& operator<<(ostream &cout, vector<A> const &v) {cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";};
template<class A, class B> ostream& operator<<(ostream &cout, const pair<A,B> &x) {return cout << "(" <<x.first << ", " << x.second << ")";};
template <class T> void pv(T a, T b) {cerr << "["; for (T i = a; i != b; ++i) cerr << *i << " "; cerr << "]\n";}
void _print() {cerr << "]\n";}
template <class T, class... V> void _print(T t, V... v) {cerr << t; if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#define fi first
#define se second
#define SZ(x) (int)((x).size())
#define pii pair<int,int>

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll n,k;
	cin >> n >> k;
	k--;
	vector<ll> t(n);
	for (int q = 0; q < n; q++) cin >> t[q];
	sort(t.begin(), t.end());
	ll tot = t[n-1]+1-t[0];
	multiset<ll> gap;
	for (int q = 1; q < n; q++) gap.insert(t[q]-(t[q-1]+1));
	while (SZ(gap) && k > 0) {
		auto it = gap.end();
		it--;
		tot -= *it;
		gap.erase(it);
		k--;
	}
	cout << tot << "\n";
	return 0;
}

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