| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 843775 |
2023-09-04T14:48:08 Z |
Iliya_ |
Stove (JOI18_stove) |
C++17 |
|
16 ms |
2356 KB |
//IN THE NAME OF GOD
#include<bits/stdc++.h>
#pragma GCC optimize("O2,unroll-loops")
#define endl '\n'
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double dll;
const int N = 1e5+7;
int a[N];
vector<int> v;
int32_t main(){
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int n,k; cin >> n >> k;
for(int i=1; i<=n; i++) cin >> a[i];
sort(a+1,a+n+1);
for(int i=1; i<n; i++) v.push_back(a[i+1]-(a[i]+1));
sort(v.begin(),v.end());
int ans = a[n] + 1 - a[1];
for(int i=1; i<k; i++){
ans -= v.back();
v.pop_back();
}
cout << ans << endl;
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 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 |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 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 |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Correct |
1 ms |
468 KB |
Output is correct |
| 16 |
Correct |
15 ms |
2272 KB |
Output is correct |
| 17 |
Correct |
16 ms |
2268 KB |
Output is correct |
| 18 |
Correct |
15 ms |
2268 KB |
Output is correct |
| 19 |
Correct |
15 ms |
2268 KB |
Output is correct |
| 20 |
Correct |
15 ms |
2268 KB |
Output is correct |
| 21 |
Correct |
16 ms |
2268 KB |
Output is correct |
| 22 |
Correct |
16 ms |
2356 KB |
Output is correct |
| 23 |
Correct |
15 ms |
2268 KB |
Output is correct |
| 24 |
Correct |
16 ms |
2268 KB |
Output is correct |
