답안 #469881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
469881	2021-09-02T08:28:05 Z	IvnF	Stove (JOI18_stove)	C++14	100 / 100	43 ms	3216 KB

stove

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ull unsigned long long
#define fi first
#define se second
#define ld long double
ll n, k, arr[100005];

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> k;
	for(int i=1;i<=n;++i){
		cin >> arr[i];
	}
	priority_queue<ll>pq;
	for(int i=2;i<=n;++i){
		pq.push((arr[i]-1)-(arr[i-1]+1)+1);
	}
	ll sums=arr[n]-arr[1]+1;
	k--;
	while(!pq.empty() && k){
		sums-=pq.top();
		pq.pop();
		k--;
	}
	cout << sums << '\n';
}

Subtask #1

20.0 / 20.0

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

Subtask #2

30.0 / 30.0

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

Subtask #3

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	320 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	316 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	332 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	332 KB	Output is correct
16	Correct	15 ms	3148 KB	Output is correct
17	Correct	15 ms	3124 KB	Output is correct
18	Correct	27 ms	3092 KB	Output is correct
19	Correct	29 ms	3136 KB	Output is correct
20	Correct	22 ms	3184 KB	Output is correct
21	Correct	28 ms	3124 KB	Output is correct
22	Correct	43 ms	3168 KB	Output is correct
23	Correct	29 ms	3148 KB	Output is correct
24	Correct	28 ms	3216 KB	Output is correct