# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1017687 |
2024-07-09T09:29:40 Z |
Bilal_Coder |
Stove (JOI18_stove) |
C++17 |
|
0 ms |
348 KB |
#include "bits/stdc++.h"
using namespace std;
#define int long long
signed main()
{
int n , k;
cin >> n >> k;
vector<int> a(n) , b;
for (int i = 0; i < n; i++){
cin >> a[i];
if (i > 0)
b.push_back(a[i] - (a[i - 1]) - 1);
}
sort(b.rbegin() , b.rend());
int m = (int)b.size();
vector<int> pf(b.begin() , b.end());
for (int i = 1; i < m; i++)
pf[i] += pf[i - 1];
if (k == 1)
cout << a[n - 1] - a[0] + 2;
else
cout << a[n - 1] - pf[k - 2] - a[0] + 1 << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |