oj.uz

Submission #978265

# Submission time Handle Problem Language Result Execution time Memory
978265 2024-05-09T05:03:13 Z wateronenn Stove (JOI18_stove) C++14
0 / 100
 0 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+9;
int arr[N];
int main(){
    cin.tie(0)->sync_with_stdio(false);
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
    }
    
    priority_queue<int> pq;
    sort(arr+1,arr+n+1);
    int all = arr[n]+1;
    for(int i=1;i<=n;i++) {
        //cout<<arr[i]-arr[i-1]-1<<" ";
         pq.push(arr[i]-arr[i-1]-1);
    }
    for(int i=1;i<=k-1;i++){
        all-=pq.top();
        pq.pop();
    }
    cout<<all-1;
    return 0;
}
/*
3 1
1
3
6
*/

Subtask #1
0 / 20.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 50.0

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