제출 #1213561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1213561		walaelaa13	Stove (JOI18_stove)	C++20	100 / 100	29 ms	1924 KiB

stove

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define int ll
#define mod 1000000007
#define pb push_back
#define vi vector<int>
#define vii vector<vi>
#define vpii vector<pair<int, int>>
#define mp make_pair
#define mpii map<int, int>
vector<vector<int>> graph;
vector<bool> visited;
int factorial(int m){
    if(m==0) return 1;
    if(m==1) return 1;
    int fact=m*factorial(m-1);
    return fact;
}
signed main() {
    int N,K;
    cin>>N>>K;
    int inter=0;
    vi t;
    int mini,maxi;
    int before;
    for(int i=0;i<N;i++){
        int temp;
        cin>>temp;
        if(i==0)mini=temp;
		if(i==N-1)maxi=temp+1;
		if(0<i)t.pb(temp-before-1);
		before=temp;
    }
    sort(t.begin(),t.end(),greater<int>());
    int sol= maxi-mini;
    for(int i=0;i<K-1;i++){
        sol-=t[i];
    }
    cout<<sol<<endl;
    

    

}

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