제출 #1131419

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131419		13emf3kmke	Stove (JOI18_stove)	C++20	0 / 100	0 ms	320 KiB

stove

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

long long minimizeStoveTime(int N, int K, vector<int>& times) {
    // Step 1: Sort the times (if not already sorted)
    sort(times.begin(), times.end());
    
    // Step 2: Calculate the gaps between consecutive intervals
    vector<int> gaps;
    for (int i = 1; i < N; ++i) {
        gaps.push_back(times[i] - (times[i-1] + 1)); // gap between intervals
    }
    
    // Step 3: Sort the gaps in ascending order
    sort(gaps.begin(), gaps.end());
    
    // Step 4: Compute the total time
    long long total_time = times.back() - times.front() + 1; // Total range of time covered
    if (N > K) {
        for (int i = 0; i < N - K; ++i) {
            total_time -= gaps[i]; // Subtract the smallest (N - K) gaps
        }
    }
    
    return total_time;
}

int main() {
    // Input parsing
    int N, K;
    cin >> N >> K;
    vector<int> times(N);
    for (int i = 0; i < N; ++i) {
        cin >> times[i];
    }
    
    // Compute and output the result
    cout << minimizeStoveTime(N, K, times) << endl;
    return 0;
}

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