oj.uz

Submission #1015556

# Submission time Handle Problem Language Result Execution time Memory
1015556 2024-07-06T14:01:01 Z adkjt Stove (JOI18_stove) C++14
100 / 100
 36 ms 3324 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
priority_queue<int> pq;
int a[111111];
signed 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]-a[1]+1;
   int cnt=0;
   while(cnt<k-1){
    ans-=pq.top();
    //cout<<pq.top()<<'\n';
    pq.pop();
    cnt++;
    }
        cout<<ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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 484 KB Output is correct
13 Correct 1 ms 484 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 0 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 484 KB Output is correct
13 Correct 1 ms 484 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 32 ms 3324 KB Output is correct
17 Correct 27 ms 3272 KB Output is correct
18 Correct 26 ms 3284 KB Output is correct
19 Correct 26 ms 3304 KB Output is correct
20 Correct 30 ms 3276 KB Output is correct
21 Correct 32 ms 3272 KB Output is correct
22 Correct 36 ms 3272 KB Output is correct
23 Correct 34 ms 3276 KB Output is correct
24 Correct 34 ms 3272 KB Output is correct