oj.uz

답안 #522618

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
522618 2022-02-05T09:32:18 Z Mondeus Stove (JOI18_stove) C++17
100 / 100
 32 ms 3204 KB 
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <sstream>
#include <queue>
using namespace std;
const int maxn = 1e6;
long long a[maxn+5];
long long n,k;
priority_queue<long long> q;
void solve()
{
    cin >> n >> k;
    k--;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    long long ans = a[n] - a[1] + 1;
    for(int i = 2; i <= n; i++)
        q.push(a[i]-a[i-1]-1);
    while(k--)
        ans -= q.top(), q.pop();
    cout << ans;

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    solve();
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 336 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 12 ms 3136 KB Output is correct
17 Correct 13 ms 3120 KB Output is correct
18 Correct 13 ms 3204 KB Output is correct
19 Correct 22 ms 3132 KB Output is correct
20 Correct 25 ms 3152 KB Output is correct
21 Correct 24 ms 3140 KB Output is correct
22 Correct 24 ms 3188 KB Output is correct
23 Correct 24 ms 3180 KB Output is correct
24 Correct 32 ms 3100 KB Output is correct