# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
127330 |
2019-07-09T08:37:47 Z |
souhhcong |
Stove (JOI18_stove) |
C++14 |
|
90 ms |
1152 KB |
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e5+5;
int n, k;
int a[N];
int diff[N], ans;
int main()
{
cin >> n >> k;
for(int i = 0; i < n; i++)
{
cin >> a[i];
if (i != 0)
{
diff[i-1] = a[i]-a[i-1]-1;
}
}
sort(diff,diff+n,greater<int>());
ans = a[n-1]-a[0]+1;
for (int i = 0; i < k-1; i++)
{
if (i >= n)
break;
ans -= diff[i];
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
256 KB |
Output is correct |
10 |
Correct |
4 ms |
376 KB |
Output is correct |
11 |
Correct |
5 ms |
376 KB |
Output is correct |
12 |
Correct |
4 ms |
380 KB |
Output is correct |
13 |
Correct |
4 ms |
380 KB |
Output is correct |
14 |
Correct |
4 ms |
388 KB |
Output is correct |
15 |
Correct |
4 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
256 KB |
Output is correct |
10 |
Correct |
4 ms |
376 KB |
Output is correct |
11 |
Correct |
5 ms |
376 KB |
Output is correct |
12 |
Correct |
4 ms |
380 KB |
Output is correct |
13 |
Correct |
4 ms |
380 KB |
Output is correct |
14 |
Correct |
4 ms |
388 KB |
Output is correct |
15 |
Correct |
4 ms |
376 KB |
Output is correct |
16 |
Correct |
82 ms |
1092 KB |
Output is correct |
17 |
Correct |
90 ms |
1152 KB |
Output is correct |
18 |
Correct |
85 ms |
1116 KB |
Output is correct |
19 |
Correct |
82 ms |
1144 KB |
Output is correct |
20 |
Correct |
82 ms |
1144 KB |
Output is correct |
21 |
Correct |
82 ms |
1144 KB |
Output is correct |
22 |
Correct |
82 ms |
1144 KB |
Output is correct |
23 |
Correct |
82 ms |
1148 KB |
Output is correct |
24 |
Correct |
82 ms |
1144 KB |
Output is correct |