| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 980854 |
2024-05-12T13:52:35 Z |
Sarvar |
Stove (JOI18_stove) |
C++14 |
|
20 ms |
3292 KB |
#include <bits/stdc++.h>
#define int long long
#define ii pair<int, int>
using namespace std;
#define inf 1e18
void fast_io()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
}
void solve()
{
int n, k;
cin >> n >> k;
vector <int> arr(n), oraliq;
for(int &i: arr) cin >> i;
sort(arr.begin(), arr.end());
int ans = abs(arr[0]-arr[n-1])+1;
for(int i = 1; n > i; i++){
oraliq.push_back(arr[i]-arr[i-1]-1);
}
sort(oraliq.rbegin(), oraliq.rend());
for(int i = 0; k-1 > i; i++){
ans -= oraliq[i];
}
cout << ans << '\n';
}
signed main()
{
fast_io();
clock_t start = clock();
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
cerr << "\n\n"
<< "Vaqt " << (double)(clock() - start) * 1000.0 / CLOCKS_PER_SEC << " ms\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 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 |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 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 |
1 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
1 ms |
348 KB |
Output is correct |
| 11 |
Correct |
1 ms |
348 KB |
Output is correct |
| 12 |
Correct |
1 ms |
348 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
348 KB |
Output is correct |
| 15 |
Correct |
1 ms |
348 KB |
Output is correct |
| 16 |
Correct |
20 ms |
3292 KB |
Output is correct |
| 17 |
Correct |
16 ms |
3292 KB |
Output is correct |
| 18 |
Correct |
16 ms |
3292 KB |
Output is correct |
| 19 |
Correct |
16 ms |
3152 KB |
Output is correct |
| 20 |
Correct |
16 ms |
3292 KB |
Output is correct |
| 21 |
Correct |
16 ms |
3292 KB |
Output is correct |
| 22 |
Correct |
17 ms |
3292 KB |
Output is correct |
| 23 |
Correct |
17 ms |
3160 KB |
Output is correct |
| 24 |
Correct |
16 ms |
3292 KB |
Output is correct |
