oj.uz

Submission #1091927

# Submission time Handle Problem Language Result Execution time Memory
1091927 2024-09-22T15:25:09 Z vjudge1 Stove (JOI18_stove) C++17
100 / 100
 18 ms 3292 KB 
#include <bits/stdc++.h>
#define int long long
#define arr2 array<int, 2>
#define popcount __builtin_popcount
#define ctz __builtin_ctz

using namespace std;

const int N = 2e5;


void fun() {
    int n, k;
    cin >> n >> k;
    int arr[n];
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    sort(arr, arr + n);
    vector<int> boz;
    for (int i = 1; i < n; ++i) {
        boz.push_back(arr[i] - arr[i - 1] - 1);
    }
    sort(boz.begin(), boz.end());
    int sum = 0;
    for (int i = 0; i < (n - k); ++i) {
        sum += boz[i];
    }
    cout << n + sum << "\n";
}

int32_t main() {
    ios::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    // int tc;
    // cin >> tc;
    // while (tc--)
    fun();
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 344 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

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 344 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 14 ms 3268 KB Output is correct
17 Correct 15 ms 3292 KB Output is correct
18 Correct 16 ms 3292 KB Output is correct
19 Correct 15 ms 3264 KB Output is correct
20 Correct 16 ms 3264 KB Output is correct
21 Correct 14 ms 3292 KB Output is correct
22 Correct 14 ms 3292 KB Output is correct
23 Correct 14 ms 3292 KB Output is correct
24 Correct 18 ms 3292 KB Output is correct