# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
638011 |
2022-09-04T08:12:22 Z |
kdn5549 |
Stove (JOI18_stove) |
C++17 |
|
21 ms |
2424 KB |
#include<bits/stdc++.h>
#define ep emplace
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
int n,k;
int main()
{
ios::sync_with_stdio(false); cin.tie(NULL);
cin>>n>>k;
vector<int> v,V;
int ret=n;
for(int i=0;i<n;i++)
{
int x; cin>>x;
v.eb(x);
}
for(int i=1;i<n;i++)
{
V.eb(v[i]-v[i-1]-1);
}
sort(all(V));
for(int i=0;i<n-k;i++)
{
ret+=V[i];
}
cout<<ret;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
320 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
320 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
316 KB |
Output is correct |
10 |
Correct |
1 ms |
360 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
332 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 |
324 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
320 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
316 KB |
Output is correct |
10 |
Correct |
1 ms |
360 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
18 ms |
2376 KB |
Output is correct |
17 |
Correct |
20 ms |
2380 KB |
Output is correct |
18 |
Correct |
17 ms |
2424 KB |
Output is correct |
19 |
Correct |
21 ms |
2388 KB |
Output is correct |
20 |
Correct |
17 ms |
2380 KB |
Output is correct |
21 |
Correct |
19 ms |
2416 KB |
Output is correct |
22 |
Correct |
17 ms |
2372 KB |
Output is correct |
23 |
Correct |
17 ms |
2392 KB |
Output is correct |
24 |
Correct |
17 ms |
2380 KB |
Output is correct |