| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 850906 |
2023-09-17T18:41:23 Z |
kflippy |
Stove (JOI18_stove) |
C++17 |
|
15 ms |
2368 KB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int N, K;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> N >> K;
int t[N];
for (int i = 0; i < N; ++i)
cin >> t[i];
int total = t[N - 1] - t[0] + 1;
vector<int> take;
for (int i = 1; i < N; ++i)
{
take.push_back(t[i] - t[i - 1] - 1);
}
sort(take.begin(), take.end(), greater<int>());
for (int i = 0; i < K - 1; ++i)
{
total -= take[i];
}
cout << total << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
456 KB |
Output is correct |
| 7 |
Correct |
1 ms |
500 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
456 KB |
Output is correct |
| 7 |
Correct |
1 ms |
500 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
492 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
0 ms |
456 KB |
Output is correct |
| 7 |
Correct |
1 ms |
500 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
348 KB |
Output is correct |
| 10 |
Correct |
1 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
348 KB |
Output is correct |
| 14 |
Correct |
1 ms |
492 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
14 ms |
2368 KB |
Output is correct |
| 17 |
Correct |
14 ms |
2272 KB |
Output is correct |
| 18 |
Correct |
14 ms |
2272 KB |
Output is correct |
| 19 |
Correct |
14 ms |
2368 KB |
Output is correct |
| 20 |
Correct |
14 ms |
2360 KB |
Output is correct |
| 21 |
Correct |
15 ms |
2268 KB |
Output is correct |
| 22 |
Correct |
15 ms |
2272 KB |
Output is correct |
| 23 |
Correct |
15 ms |
2272 KB |
Output is correct |
| 24 |
Correct |
14 ms |
2268 KB |
Output is correct |
