답안 #870991

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
870991	2023-11-09T16:33:54 Z	marcid	Stove (JOI18_stove)	C++17	100 / 100	14 ms	1808 KB

stove

#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;

int main() {
	cin.tie(0)->sync_with_stdio(false); cout.tie(0);
	int n, k; cin >> n >> k;
	int a[n];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < n-1; i++) {
		a[i]=a[i+1]-a[i]-1;
	}
	int sum = n;
	sort(a, a+n);
	for (int i = 0; i < n-k; i++) {
		sum += a[i];
	} cout << sum;
}

Subtask #1

20.0 / 20.0

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

Subtask #2

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	504 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct

Subtask #3

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	504 KB	Output is correct
4	Correct	0 ms	456 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	492 KB	Output is correct
14	Correct	1 ms	592 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	14 ms	1624 KB	Output is correct
17	Correct	14 ms	1628 KB	Output is correct
18	Correct	14 ms	1724 KB	Output is correct
19	Correct	14 ms	1628 KB	Output is correct
20	Correct	14 ms	1808 KB	Output is correct
21	Correct	14 ms	1624 KB	Output is correct
22	Correct	14 ms	1628 KB	Output is correct
23	Correct	14 ms	1624 KB	Output is correct
24	Correct	14 ms	1624 KB	Output is correct