답안 #1012992

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1012992	2024-07-03T04:25:35 Z	aufan	Stove (JOI18_stove)	C++17	100 / 100	16 ms	3368 KB

stove

#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second

using namespace std;

int32_t main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        int n, k;
        cin >> n >> k;

        vector<int> t(n + 1);
        for (int i = 1; i <= n; i++) cin >> t[i];

        vector<int> b;
        for (int i = 1; i <= n - 1; i++) b.push_back(t[i + 1] - t[i]);
        sort(b.rbegin(), b.rend());

        int ans = t[n] + 1 - t[1];
        for (int i = 0; i < k - 1; i++) {
                ans -= (b[i] - 1);
        }

        cout << ans << '\n';
        
        return 0;
}

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	348 KB	Output is correct
4	Correct	0 ms	452 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	348 KB	Output is correct
4	Correct	0 ms	452 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	348 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	348 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	348 KB	Output is correct
4	Correct	0 ms	452 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	348 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	16 ms	3156 KB	Output is correct
17	Correct	13 ms	3368 KB	Output is correct
18	Correct	14 ms	3248 KB	Output is correct
19	Correct	13 ms	3164 KB	Output is correct
20	Correct	14 ms	3292 KB	Output is correct
21	Correct	14 ms	3204 KB	Output is correct
22	Correct	14 ms	3292 KB	Output is correct
23	Correct	14 ms	3288 KB	Output is correct
24	Correct	14 ms	3288 KB	Output is correct