oj.uz

Submission #541627

# Submission time Handle Problem Language Result Execution time Memory
541627 2022-03-23T22:59:27 Z Olympia Stove (JOI18_stove) C++17
0 / 100
 0 ms 212 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <limits.h>

using namespace std;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, K;
    cin >> N >> K;
    K = N - K;
    vector<int> arr(N);
    vector<int> dif;
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
        if (i != 0) {
            dif.push_back(arr[i] - arr[i - 1] - 1);
        }
    }
    sort(dif.begin(), dif.end());
    int64_t ans = N;
    while (!dif.empty() && K--) {
        dif.pop_back();
    }
    while (!dif.empty()) {
        ans += dif.back();
        dif.pop_back();
    }
    cout << ans;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -