# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
315383 |
2020-10-22T19:01:55 Z |
jjj |
Stove (JOI18_stove) |
C++14 |
|
93 ms |
1688 KB |
#include <bits/stdc++.h>
using namespace std;
int a[100010];
int main()
{
int n, k;
cin >> n >> k;
int t0, t1;
cin >> t0;
for(int i = 0; i < n - 1; i++)
{
cin >> t1;
a[i] = t1 - t0 - 1;
t0 = t1;
}
sort(a, a + n);
int s = n;
for(int i = 0; i < (n - k + 1); i++) s += a[i];
cout << s;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
1 ms |
256 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
0 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
1 ms |
256 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
0 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
3 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
256 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
3 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
1 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
1 ms |
256 KB |
Output is correct |
6 |
Correct |
1 ms |
384 KB |
Output is correct |
7 |
Correct |
1 ms |
256 KB |
Output is correct |
8 |
Correct |
0 ms |
256 KB |
Output is correct |
9 |
Correct |
1 ms |
256 KB |
Output is correct |
10 |
Correct |
3 ms |
384 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
3 ms |
256 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
3 ms |
384 KB |
Output is correct |
15 |
Correct |
3 ms |
384 KB |
Output is correct |
16 |
Correct |
92 ms |
1564 KB |
Output is correct |
17 |
Correct |
91 ms |
1656 KB |
Output is correct |
18 |
Correct |
92 ms |
1656 KB |
Output is correct |
19 |
Correct |
92 ms |
1656 KB |
Output is correct |
20 |
Correct |
93 ms |
1656 KB |
Output is correct |
21 |
Correct |
91 ms |
1400 KB |
Output is correct |
22 |
Correct |
92 ms |
1688 KB |
Output is correct |
23 |
Correct |
92 ms |
1656 KB |
Output is correct |
24 |
Correct |
93 ms |
1404 KB |
Output is correct |