# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524362 | 2022-02-09T06:17:39 Z | reni | Stove (JOI18_stove) | C++17 | 21 ms | 2828 KB |
#include<bits/stdc++.h> #define endl '\n' using namespace std; long long a[100003], r[100003]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n,k,i,brm,res=0; cin>>n>>k; for(i=0;i<n;i++) { cin>>a[i]; if(i!=0)r[i-1]=a[i]-a[i-1]-1; } sort(r,r+n-1); res=a[n-1]-a[0]+1; for(i=n-2;i>=n-k;i--) { res-=r[i]; } cout<<res<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 320 KB | Output is correct |
2 | Correct | 0 ms | 324 KB | Output is correct |
3 | Correct | 0 ms | 320 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 328 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 1 ms | 320 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 320 KB | Output is correct |
2 | Correct | 0 ms | 324 KB | Output is correct |
3 | Correct | 0 ms | 320 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 328 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 1 ms | 320 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 | 368 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 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 320 KB | Output is correct |
2 | Correct | 0 ms | 324 KB | Output is correct |
3 | Correct | 0 ms | 320 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 328 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 1 ms | 320 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 | 368 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 | 2828 KB | Output is correct |
17 | Correct | 17 ms | 2728 KB | Output is correct |
18 | Correct | 16 ms | 2712 KB | Output is correct |
19 | Correct | 17 ms | 2820 KB | Output is correct |
20 | Correct | 21 ms | 2760 KB | Output is correct |
21 | Correct | 18 ms | 2776 KB | Output is correct |
22 | Correct | 17 ms | 2756 KB | Output is correct |
23 | Correct | 17 ms | 2736 KB | Output is correct |
24 | Correct | 18 ms | 2732 KB | Output is correct |