oj.uz

Submission #1015541

# Submission time Handle Problem Language Result Execution time Memory
1015541 2024-07-06T13:45:06 Z adkjt Stove (JOI18_stove) C++14
0 / 100
 0 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
priority_queue<int> pq;
int a[111111];
int main()
{
   int n,k;cin>>n>>k;
   for(int i=1;i<=n;i++)
    cin>>a[i];
   for(int i=2;i<=n;i++)
    pq.push(a[i]-a[i-1]-1);
   int ans=a[n];
   int cnt=1;
   while(cnt<k){
    ans-=pq.top();
    //cout<<pq.top()<<'\n';
    pq.pop();
    cnt++;
    }
        cout<<ans<<'\n';
}

Subtask #1
0 / 20.0

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