oj.uz

답안 #875813

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
875813 2023-11-20T14:28:51 Z I_FloPPed21 Stove (JOI18_stove) C++14
100 / 100
 42 ms 2760 KB 
    #include <iostream>
    #include <bits/stdc++.h>
    using namespace std;
     
    long long n, k ;
    long long v [ 200005 ];
    int main()
    {
        cin >> n >> k ;
     
        k --  ;
     
        long long sum = 0 ;
        priority_queue<int> pq;
        for( int i = 1; i <= n ; i ++ )
        {
            cin >> v[ i ];
            if ( i != 1 )
            {
                sum += ( v[ i ] - v[ i - 1 ] ) ;
                pq.push(v [ i ] - v[ i - 1 ] - 1 ) ;
            }
     
            //cout << sum<< '\n';
        }
     
     
        sum ++ ;
        for ( int i = 1; i <= min(k,n) ; i ++ )
            {
     
                sum -= pq.top();
                pq.pop();
            }
     
        cout << sum << '\n';
        return 0;
    }

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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 528 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 528 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 29 ms 2696 KB Output is correct
17 Correct 29 ms 2508 KB Output is correct
18 Correct 29 ms 2516 KB Output is correct
19 Correct 30 ms 2504 KB Output is correct
20 Correct 34 ms 2512 KB Output is correct
21 Correct 37 ms 2596 KB Output is correct
22 Correct 38 ms 2516 KB Output is correct
23 Correct 37 ms 2516 KB Output is correct
24 Correct 42 ms 2760 KB Output is correct