답안 #966821

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
966821	2024-04-20T12:16:49 Z	vjudge1	Stove (JOI18_stove)	C++17	100 / 100	21 ms	2384 KB

stove

#include <bits/stdc++.h>
#define int long long
#define pii pair < int , int >
#define f first
#define s second

using namespace std;

const int inf = -1e18;

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

    int n , kib; cin >> n >> kib;
    priority_queue < int > q;

    int a[n];
    int cavab=n;
    for(int i = 0;i < n;i++)
    {
        cin >> a[i];
        if(i > 0)
        {
            cavab+=a[i]-(a[i-1]+1);
            q.push(a[i]-(a[i-1]+1));
        }
    }

    if(n==kib)
    {
        cout << n;
        return 0;
    }

    while(kib>1)
    {
        cavab-=q.top();
        q.pop();
        kib--;
    }
    cout << cavab;
}

Subtask #1

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 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	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	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct

Subtask #2

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 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	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	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 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	492 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	532 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct

Subtask #3

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 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	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	600 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 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	492 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	532 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	10 ms	2384 KB	Output is correct
17	Correct	12 ms	2296 KB	Output is correct
18	Correct	10 ms	2268 KB	Output is correct
19	Correct	11 ms	2264 KB	Output is correct
20	Correct	15 ms	2264 KB	Output is correct
21	Correct	21 ms	2348 KB	Output is correct
22	Correct	20 ms	2268 KB	Output is correct
23	Correct	19 ms	2268 KB	Output is correct
24	Correct	19 ms	2268 KB	Output is correct