oj.uz

Submission #516469

# Submission time Handle Problem Language Result Execution time Memory
516469 2022-01-21T11:23:33 Z srivatsav_kannan Stove (JOI18_stove) C++14
100 / 100
 26 ms 2360 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <queue>
#include <cmath>
#include <map>
#include <algorithm>
#include <numeric>
#include <stack>
#include <cstring>
#include <bitset>
using namespace std;
#define int long long int
#define mod 1000000007
#define endl '\n'
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n,k; cin >> n >> k;
    vector<int> ans;
    int prev; cin >> prev;
    for (int i = 1; i < n; i++){
        int a; cin >> a;
        ans.push_back(a-prev);
        prev = a;
    }
    int anss = 0;
    sort(ans.begin(), ans.end());
    for (int i = 0; i < n-k; i++){
        ans[i]--;
        anss += ans[i];
    }
    cout << anss+n << endl;
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 0 ms 204 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 17 ms 2344 KB Output is correct
17 Correct 18 ms 2236 KB Output is correct
18 Correct 21 ms 2356 KB Output is correct
19 Correct 21 ms 2360 KB Output is correct
20 Correct 17 ms 2240 KB Output is correct
21 Correct 26 ms 2260 KB Output is correct
22 Correct 19 ms 2308 KB Output is correct
23 Correct 19 ms 2268 KB Output is correct
24 Correct 19 ms 2300 KB Output is correct