oj.uz

Submission #1003744

# Submission time Handle Problem Language Result Execution time Memory
1003744 2024-06-20T16:44:09 Z codexistent Stove (JOI18_stove) C++14
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define FOR(i, a, b) for(int i = a; i <= b; i++)
 
int n, m, arr[MAXN];
 
int main(){
    cin >> n >> m;
    FOR(i, 1, n) cin >> arr[i];
    sort(arr + 1, arr + 1 + n);
 
    multiset<int> s;
    FOR(i, 1, n - 1) s.insert(arr[i + 1] - arr[i] - 1);
 
    int res = arr[n] - arr[1] + 1;
    while(s.size() && m){
        res -= *(s.rbegin());
        s.erase(s.find(*(s.rbegin())));
        m--;
    }
 
    cout << res << endl;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 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 348 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 348 KB Output isn't correct
2 Halted 0 ms 0 KB -