Submission #1089450

# Submission time Handle Problem Language Result Execution time Memory
1089450 2024-09-16T14:20:40 Z andrewkong972 Stove (JOI18_stove) C++14
100 / 100
33 ms 2004 KB
#include <bits/stdc++.h>
using namespace std;

int main() {
    int sum = 0, cur1, cur2, n,k; cin >> n >> k;
    vector<int> dif;
    
    for (int i=0; i<n; i++) {
         cin >> cur1;
         if (i !=0) dif.push_back(cur1 - cur2 - 1);
         cur2 = cur1;
    }
    
    sort(dif.begin(), dif.end());
    
    for (int i=0; i<n-k; i++) sum += dif[i];
    
    cout << sum + n;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 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
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 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 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 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 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 31 ms 2004 KB Output is correct
17 Correct 33 ms 1752 KB Output is correct
18 Correct 30 ms 1752 KB Output is correct
19 Correct 29 ms 1752 KB Output is correct
20 Correct 32 ms 1740 KB Output is correct
21 Correct 31 ms 2004 KB Output is correct
22 Correct 32 ms 1884 KB Output is correct
23 Correct 31 ms 1732 KB Output is correct
24 Correct 30 ms 1900 KB Output is correct