# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
593275 | 2022-07-10T18:30:23 Z | Summers | Stove (JOI18_stove) | C++14 | 18 ms | 1908 KB |
#include<bits/stdc++.h> #define endl '\n' using namespace std; long long a[1000000], dif[1000000]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); long long n,i,j,k,br=0,num,k1,sum=0; cin>>n>>k; for(i=0;i<n;i++) { cin>>a[i]; if(i!=0)dif[i]=a[i]-a[i-1]; } sort(dif+1,dif+n); sum=a[n-1]-a[0]+1; for(i=n-1;i>n-k;i--) { sum-=dif[i]-1;br++;dif[i]=-1; } cout<<sum<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 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 | 340 KB | Output is correct |
14 | Correct | 1 ms | 340 KB | Output is correct |
15 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 0 ms | 212 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 0 ms | 212 KB | Output is correct |
9 | Correct | 0 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 | 340 KB | Output is correct |
14 | Correct | 1 ms | 340 KB | Output is correct |
15 | Correct | 1 ms | 340 KB | Output is correct |
16 | Correct | 18 ms | 1876 KB | Output is correct |
17 | Correct | 15 ms | 1908 KB | Output is correct |
18 | Correct | 16 ms | 1904 KB | Output is correct |
19 | Correct | 16 ms | 1904 KB | Output is correct |
20 | Correct | 16 ms | 1908 KB | Output is correct |
21 | Correct | 17 ms | 1840 KB | Output is correct |
22 | Correct | 16 ms | 1908 KB | Output is correct |
23 | Correct | 18 ms | 1848 KB | Output is correct |
24 | Correct | 16 ms | 1876 KB | Output is correct |