# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931083 | 2024-02-21T08:09:04 Z | hugsfromadicto | Stove (JOI18_stove) | C++14 | 18 ms | 3444 KB |
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define int long long using namespace std; const int mxN = 1e5+1; int a[mxN]; void _() { int n,k; cin >> n >> k; for(int i = 0; i < n; ++i) cin >> a[i]; vector<int>v; for(int i = 1; i < n; ++i) { v.push_back(a[i] - a[i - 1] - 1); } sort(v.begin(),v.end(),greater<int>()); int ans = a[n - 1] + 1 - a[0]; for(int i = 0; i < k - 1; ++i) ans -= v[i]; cout << ans; } main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1; //cin>>tc; while(tc--) { _(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 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 | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 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 | 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 | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 1 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 | 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 | 348 KB | Output is correct |
16 | Correct | 14 ms | 3292 KB | Output is correct |
17 | Correct | 15 ms | 3444 KB | Output is correct |
18 | Correct | 15 ms | 3296 KB | Output is correct |
19 | Correct | 16 ms | 3292 KB | Output is correct |
20 | Correct | 18 ms | 3296 KB | Output is correct |
21 | Correct | 15 ms | 3292 KB | Output is correct |
22 | Correct | 15 ms | 3288 KB | Output is correct |
23 | Correct | 14 ms | 3292 KB | Output is correct |
24 | Correct | 15 ms | 3292 KB | Output is correct |