제출 #540220

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
540220		lynnetan	Stove (JOI18_stove)	C++17	0 / 100	1 ms	340 KiB

stove

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;


struct number {
    int num, diff;

    number(int n) {
        num = n;
    }
};

bool compareNum(number n1, number n2) {
    return n1.num <= n2.num;
}

bool compareDiff(number n1, number n2) {
    return n1.diff <= n2.diff;
}

int countDiff(number n1, number n2) {
    return n2.num - n1.num;
}


int main() {
    int n, k, inputNum;
    cin >> n >> k;

    vector<number> arr;

    for(int i = 0; i < n; i++) {
        cin >> inputNum;
        arr.push_back(number(inputNum));
    }

    sort(arr.begin(), arr.end(), compareNum);


    if(k < n) {
        for(int i = 1; i < n; i++) {
            arr[i].diff = countDiff(arr[i-1], arr[i]);
        }

        sort(arr.begin(), arr.end(), compareDiff);

        int sum = n;

        
        int x = n - k + 1;
        for (int i = 1; i < x; i++) {
            sum += arr[i].diff - 1;
        }

        cout << sum;

    } else {
        cout << n;
    }

    return 0;
}

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