답안 #151771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
151771	2019-09-04T16:03:45 Z	jhwest2	Stove (JOI18_stove)	C++14	100 / 100	33 ms	2424 KB

stove

#include <bits/stdc++.h>
#define va first
#define vb second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int n, k;
int ans = 0;
int arr[101010];
priority_queue<int, vector<int>, greater<int>> pq;

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(0);

	cin >> n >> k;
	for (int i=0; i<n; i++) cin >> arr[i];

	sort(arr, arr+n);

	for (int i=0; i<n-1; i++) {
		pq.push(arr[i+1]-arr[i]-1);
	}

	for (int i=0; i<n-k; i++) {
		ans += pq.top();
		pq.pop();
	}

	ans += n;

	cout << ans;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct

Subtask #2

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	3 ms	376 KB	Output is correct
12	Correct	3 ms	380 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct

Subtask #3

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	3 ms	376 KB	Output is correct
12	Correct	3 ms	380 KB	Output is correct
13	Correct	3 ms	376 KB	Output is correct
14	Correct	3 ms	376 KB	Output is correct
15	Correct	3 ms	376 KB	Output is correct
16	Correct	33 ms	2424 KB	Output is correct
17	Correct	33 ms	2296 KB	Output is correct
18	Correct	33 ms	2424 KB	Output is correct
19	Correct	32 ms	2424 KB	Output is correct
20	Correct	27 ms	2292 KB	Output is correct
21	Correct	22 ms	2424 KB	Output is correct
22	Correct	21 ms	2296 KB	Output is correct
23	Correct	20 ms	2296 KB	Output is correct
24	Correct	20 ms	2296 KB	Output is correct