답안 #1033696

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1033696	2024-07-25T04:17:24 Z	vjudge1	Stove (JOI18_stove)	C++17	100 / 100	17 ms	2268 KB

stove

#include <bits/stdc++.h>
#define int long long
#define fi first
#define pll pair<long long, long long>
#define se second
#define isz(a) (int)a.size()
using namespace std;

const long long inf = 1e18;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;

int n, k;
int a[maxn];

void subfull(){
    priority_queue<int> pq;
    for (int i = 2; i <= n; ++i) pq.push(a[i] - a[i - 1]);
    int ans = a[n] - a[1] + 1;
    int cnt = 1;
    while (cnt < k){
        int x = pq.top();
        pq.pop();
        ans -= x - 1;
        ++cnt;
    }
    cout << ans;
}

void solve(){
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    subfull();
}   

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int t = 1; // cin >> t;
    while (t--){
        solve();
    }
}

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	348 KB	Output is correct
5	Correct	0 ms	344 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	344 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	348 KB	Output is correct
5	Correct	0 ms	344 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	344 KB	Output is correct
10	Correct	1 ms	344 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	348 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	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	348 KB	Output is correct
5	Correct	0 ms	344 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	344 KB	Output is correct
10	Correct	1 ms	344 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	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	8 ms	2264 KB	Output is correct
17	Correct	9 ms	2264 KB	Output is correct
18	Correct	8 ms	2268 KB	Output is correct
19	Correct	8 ms	2268 KB	Output is correct
20	Correct	13 ms	2268 KB	Output is correct
21	Correct	14 ms	2176 KB	Output is correct
22	Correct	15 ms	2264 KB	Output is correct
23	Correct	17 ms	2200 KB	Output is correct
24	Correct	16 ms	2268 KB	Output is correct