# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
959703 |
2024-04-08T21:30:33 Z |
vjudge1 |
Stove (JOI18_stove) |
C++17 |
|
14 ms |
2392 KB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
int n, k;
int times[MAXN];
void opt()
{
ios_base :: sync_with_stdio(false);
cin.tie(nullptr);
}
int main()
{
opt();
cin>>n>>k;
for (int i = 0; i < n; i++)
{
cin>>times[i];
}
int resp = n;
vector <int> difs;
for (int i = 1; i < n; i++)
{
difs.push_back(times[i] - times[i-1] -1);
}
sort(difs.begin(), difs.end());
for (int i = 0; i < n - k; i++)
{
resp += difs[i];
}
cout<<resp<<"\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
356 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
460 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
356 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
460 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
500 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
472 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
356 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
460 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
500 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
472 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
1 ms |
348 KB |
Output is correct |
16 |
Correct |
14 ms |
2272 KB |
Output is correct |
17 |
Correct |
14 ms |
2272 KB |
Output is correct |
18 |
Correct |
14 ms |
2268 KB |
Output is correct |
19 |
Correct |
14 ms |
2272 KB |
Output is correct |
20 |
Correct |
14 ms |
2272 KB |
Output is correct |
21 |
Correct |
14 ms |
2272 KB |
Output is correct |
22 |
Correct |
14 ms |
2272 KB |
Output is correct |
23 |
Correct |
14 ms |
2392 KB |
Output is correct |
24 |
Correct |
14 ms |
2268 KB |
Output is correct |