fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b) {
  14. int x = 1;
  15. a %= M;
  16. while (b) {
  17. if (b & 1) x = (x * a) % M;
  18. a = (a * a) % M;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n, int m, int k){
  33.  
  34. vector<int> dif;
  35. for(int i=1; i<n; i++){
  36. dif.push_back(a[i] - a[i-1] - 1);
  37. }
  38. sort(begin(dif), end(dif));
  39.  
  40. int ans = n;
  41. for(int i=0; i<n-k; i++){
  42. ans += dif[i];
  43. }
  44.  
  45. return ans;
  46. }
  47.  
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62. int practice(int n, int m, int k){
  63.  
  64.  
  65. return 0;
  66. }
  67.  
  68.  
  69.  
  70.  
  71.  
  72. void solve() {
  73.  
  74. int n, m, k;
  75. cin>> n >> m >> k;
  76.  
  77. a.resize(n);
  78. for(int i=0; i<n; i++) cin >> a[i];
  79.  
  80. cout << consistency(n, m, k) << endl;
  81.  
  82.  
  83. }
  84.  
  85.  
  86.  
  87.  
  88.  
  89. int32_t main() {
  90. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  91.  
  92. int t = 1;
  93. // cin >> t;
  94. while (t--) {
  95. solve();
  96. }
  97.  
  98. return 0;
  99. }
Success #stdin #stdout 0s 5308KB
stdin
4 10 2
1 3 6 8
stdout
6