oj.uz

Submission #1007345

# Submission time Handle Problem Language Result Execution time Memory
1007345 2024-06-24T16:22:11 Z em4ma2 Stove (JOI18_stove) C++14
100 / 100
 13 ms 2392 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define applejuice ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define endl '\n'
#define mxsz 100005
#define ll long long
 
signed main(){
    
    applejuice;
    
    int n,k;
    cin>>n>>k;
    int a[n];
    for (int i=0;i<n;i++)cin>>a[i];
    
    int diff[n];
    diff[0]=1;
    
    for (int i=1;i<n;i++){
        diff[i]=a[i]-a[i-1];
    }
    
    sort(diff,diff+n);
    reverse(diff,diff+n);
    
    k--;
    
    for (int i=0;i<n;i++){
        if (k==0)break;
        
        if (diff[i]>1){
            diff[i]=1;
            k--;
        }
    }
    
    int sum=0;
    
    for (int i=0;i<n;i++){
        sum+=diff[i];
    }
    
    cout<<sum;
    
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 1 ms 348 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 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 504 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 1 ms 348 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 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 504 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 13 ms 2112 KB Output is correct
17 Correct 13 ms 1984 KB Output is correct
18 Correct 13 ms 2392 KB Output is correct
19 Correct 13 ms 2140 KB Output is correct
20 Correct 13 ms 2140 KB Output is correct
21 Correct 13 ms 2204 KB Output is correct
22 Correct 13 ms 2140 KB Output is correct
23 Correct 13 ms 2204 KB Output is correct
24 Correct 13 ms 2004 KB Output is correct