답안 #1089847

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1089847	2024-09-17T09:54:33 Z	Frostidian	Stove (JOI18_stove)	C++14	100 / 100	19 ms	3108 KB

stove

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define endl "\n"

const int MX = 1e5 + 5;

int a[MX], sa = 0, n, k;
priority_queue < int > pq;

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

    cin >> n >> k;
    for ( int i = 1; i <= n; i++ ){
        cin >> a[i]; 
        if ( i == 1 ) continue;
        pq.push(a[i] - a[i - 1] - 1);
        sa += ( a[i] - a[i - 1] - 1 );
    }

    for ( int i = 1; i <= k - 1; i++ ){
        sa -= pq.top(); pq.pop();
    }

    cout << sa + n << endl;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 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	344 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	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 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	344 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	344 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	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 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	344 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	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	9 ms	3036 KB	Output is correct
17	Correct	10 ms	3048 KB	Output is correct
18	Correct	10 ms	3036 KB	Output is correct
19	Correct	11 ms	3008 KB	Output is correct
20	Correct	14 ms	3036 KB	Output is correct
21	Correct	17 ms	3108 KB	Output is correct
22	Correct	18 ms	3056 KB	Output is correct
23	Correct	19 ms	3036 KB	Output is correct
24	Correct	18 ms	3032 KB	Output is correct