답안 #932308

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932308 2024-02-23T07:52:53 Z ntmin Stove (JOI18_stove) C++14
100 / 100
19 ms 2360 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
#define fi first
#define sc second

const int N = 1e5 + 1;
int n, k, a[N];

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

    cin >> n >> k;
    for(int i = 1; i <= n; ++i) cin >> a[i];

    int ans = a[n] + 1 - a[1];
    priority_queue<int> q;
    for(int i = 1; i < n; ++i){
        q.push(a[i + 1] - a[i] - 1);
    }
    for(int i = 1; i < k; ++i){
        ans -= q.top();
        q.pop();
    }

    cout << ans;

    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 460 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
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 460 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 540 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 460 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 540 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 10 ms 2272 KB Output is correct
17 Correct 10 ms 2272 KB Output is correct
18 Correct 10 ms 2328 KB Output is correct
19 Correct 11 ms 2360 KB Output is correct
20 Correct 14 ms 2268 KB Output is correct
21 Correct 18 ms 2272 KB Output is correct
22 Correct 19 ms 2268 KB Output is correct
23 Correct 18 ms 2272 KB Output is correct
24 Correct 18 ms 2268 KB Output is correct