oj.uz

답안 #967651

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967651 2024-04-22T15:05:53 Z jadai007 Stove (JOI18_stove) C++17
100 / 100
 21 ms 2272 KB 
#include<bits/stdc++.h>

using namespace std;

priority_queue<int> pq;
int n, k, T[100100], ans;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> n >> k;
    for(int i = 1; i<=n; ++i) cin >> T[i];
    sort(T+1, T+1+n);
    k--;
    for(int i = 2; i<=n; ++i) pq.push(T[i] - T[i - 1] - 1);
    ans = T[n] - T[1] + 1;
    while(k--){
        ans-=pq.top();
        pq.pop();
    }
    cout << ans;
}

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 1 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 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 1 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 476 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 348 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 1 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 476 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 348 KB Output is correct
16 Correct 15 ms 2012 KB Output is correct
17 Correct 11 ms 2012 KB Output is correct
18 Correct 11 ms 2152 KB Output is correct
19 Correct 12 ms 2016 KB Output is correct
20 Correct 15 ms 2160 KB Output is correct
21 Correct 19 ms 2012 KB Output is correct
22 Correct 20 ms 2016 KB Output is correct
23 Correct 19 ms 2004 KB Output is correct
24 Correct 21 ms 2272 KB Output is correct