This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 1e6+100, M = 1e5+10, K = 20;
int n, k, t[N], a[N];
void solve(){
cin >> n >> k;
for(int i = 0; i < n; ++i) cin >> t[i];
sort(t, t + n);
for(int i = 0; i < n - 1; ++i) a[i] = t[i + 1] - t[i];
sort(a, a + n - 1, greater<int>());
int ans = t[n - 1] - t[0] + 1;
for(int i = 0; i < k - 1; ++i){
ans -= a[i] - 1;
}
cout << ans;
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int T = 1, aa;
// cin >> T;aa=T;
while(T--){
// cout << "Case #" << aa-T << ": ";
solve();
cout << '\n';
}
return 0;
}
Compilation message (stderr)
stove.cpp: In function 'int main()':
stove.cpp:30:14: warning: unused variable 'aa' [-Wunused-variable]
30 | int T = 1, aa;
| ^~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |