oj.uz

Submission #966452

# Submission time Handle Problem Language Result Execution time Memory
966452 2024-04-19T22:51:49 Z m0vlan Stove (JOI18_stove) C++17
100 / 100
 15 ms 2520 KB 
#include <bits/stdc++.h>
using namespace std;
// author: Movlan
#define ll long long
//#define int long long
#define br "\n"
#define sp " "
#define pb push_back
#define pf push_front
typedef pair<ll,int> pii;
#define vi vector<int>;
#define vpii vector<pair<int,int>>
#define all(x) x.begin(),x.end()
#define sync ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
struct edge{
    //int u;
    int v;
    ll w;bool operator<(edge const& other){return w<other.w;}
};


void solve(){
    int n,k;
    cin>>n>>k;
    int arr[n];
    ll res=n;
    for(int i=0;i<n;i++){
        cin>>arr[i];
    }
    ll sum=0;
    vector<int>diff;
    for(int i=1;i<=n-1;i++){
        diff.pb(arr[i]-arr[i-1]-1);
        sum+=(arr[i]-arr[i-1]-1);
    }
    sort(all(diff));
    k--;
    for(int i=n-2;i>=0 && k!=0;i--) {
        k--;
        sum-=diff[i];
    }
    cout<<sum+res;
}

signed main() {
    sync;
    int t=1;
    //cin >> t;
    while(t--){
        solve();
        //cout<<br;
    }
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 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 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 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 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 15 ms 2420 KB Output is correct
17 Correct 14 ms 2272 KB Output is correct
18 Correct 15 ms 2272 KB Output is correct
19 Correct 14 ms 2272 KB Output is correct
20 Correct 14 ms 2272 KB Output is correct
21 Correct 15 ms 2364 KB Output is correct
22 Correct 15 ms 2368 KB Output is correct
23 Correct 14 ms 2520 KB Output is correct
24 Correct 15 ms 2268 KB Output is correct