| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 835022 |
2023-08-23T06:06:08 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
15 ms |
2668 KB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 1e6;
ll n, k;
ll t[MAXN];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> t[i];
vector<int> mmb;
for (int i = 0; i < n; i++)
if (i > 0)
mmb.push_back(t[i] - t[i - 1] - 1);
sort(mmb.rbegin(), mmb.rend());
cout << (t[n - 1] + 1) - t[0] - accumulate(mmb.begin(), mmb.begin() + k - 1, 0);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
260 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
260 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 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 |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
260 KB |
Output is correct |
| 6 |
Correct |
1 ms |
212 KB |
Output is correct |
| 7 |
Correct |
0 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 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 |
14 ms |
2648 KB |
Output is correct |
| 17 |
Correct |
15 ms |
2648 KB |
Output is correct |
| 18 |
Correct |
15 ms |
2648 KB |
Output is correct |
| 19 |
Correct |
15 ms |
2648 KB |
Output is correct |
| 20 |
Correct |
14 ms |
2632 KB |
Output is correct |
| 21 |
Correct |
14 ms |
2648 KB |
Output is correct |
| 22 |
Correct |
15 ms |
2668 KB |
Output is correct |
| 23 |
Correct |
14 ms |
2648 KB |
Output is correct |
| 24 |
Correct |
14 ms |
2648 KB |
Output is correct |
