백준 13164번 행복 유치원 C++

https://www.acmicpc.net/problem/13164

13164번: 행복 유치원

 

그리디 알고리즘

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n, k;
    cin >> n >> k;
    vector<int> v(n);
    vector<int> v2;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    for (int i = 1; i < n; i++) {
        v2.push_back(v[i] - v[i - 1]);
    }
    sort(v2.begin(), v2.end());
    int64 sum = 0;
    for (int i = 0; i < v2.size() - (k - 1); i++) {
        sum += v2[i];
    }
    cout << sum;
}