Submission #769342

#	Time	Username	Problem	Language	Result	Execution time	Memory
769342		Mery2005	Stove (JOI18_stove)	C++14	100 / 100	36 ms	2376 KiB

stove

#include <iostream>
#include <algorithm>
#include <queue>
#include <cmath>
#include <vector>
#include <list>
#include <string>
#include <unordered_map>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <iomanip>
#include <fstream>
 
using namespace std;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
}

const long long mod = 1e9+7;
const int N = 3e5+5;
int a[N] , dp[N];

void solve(){
  int n , k;
  cin >> n >> k;
  for(int i = 1 ; i <= n ; i++){
    cin >> a[i];
  }
  vector<int> v;
  int start = a[1];
  for(int i = 2 ; i <= n ; i++){
    if(a[i] - start != 1){
      v.push_back(a[i] - start - 1);
    }
    start = a[i];
  }
  sort(v.begin() , v.end());
  int l = v.size();
  long long int ans = n * 1ll;
  for(int i = 0 ; i < (l-k + 1) ; i++){
    ans += v[i] * 1ll;
  }
  cout << ans << endl;
}

int main(){
  solve();
  return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50