oj.uz

Submission #755033

# Submission time Handle Problem Language Result Execution time Memory
755033 2023-06-09T10:24:22 Z davit_tsibadze Stove (JOI18_stove) C++17
100 / 100
 21 ms 2264 KB 
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <climits>
#include <iomanip>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
 
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
 
const ll mod = 1e9 + 7;
const ll inf = 1e18;
// #define int long long

void solve(){
    int n, k;
    cin >> n >> k;
    vector <int> a(n), arr;
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    for(int i = 1; i < n; i++){
        arr.pb(a[i] - a[i - 1] - 1);
    }
    sort(arr.begin(), arr.end());
    int m = n - k, ans = n, l = 0;
    while(m--){
        ans += arr[l];
        l++;
    }
    cout << ans;
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
 
    int T = 1;
    // cin >> T;
    while(T--){
        solve();
        cout << '\n';
    }
 
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 336 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 336 KB Output is correct
16 Correct 18 ms 2192 KB Output is correct
17 Correct 21 ms 2248 KB Output is correct
18 Correct 17 ms 2248 KB Output is correct
19 Correct 19 ms 2248 KB Output is correct
20 Correct 18 ms 2256 KB Output is correct
21 Correct 17 ms 2240 KB Output is correct
22 Correct 17 ms 2236 KB Output is correct
23 Correct 17 ms 2256 KB Output is correct
24 Correct 17 ms 2264 KB Output is correct