제출 #1290461

#제출 시각아이디문제언어결과실행 시간메모리
1290461azradudukalayStove (JOI18_stove)C++20
100 / 100
37 ms1056 KiB
#include <bits/stdc++.h>
using namespace std;
int n,k,temp,temp1,nk,ans;
vector <int> fark;
int main() 
{
    int n,k,temp,temp1,nk,ans=0;
    vector <int> fark;
    cin>>n>>k;
    for(int j = 0; j<n; ++j)
    {
        cin>>temp;
        if(j != 0) fark.push_back(temp-(temp1+1));
        temp1 = temp;
    } 
    nk = fark.size();  
    sort(fark.begin(),fark.end());
    for(int j = nk-1; k-1 != 0; --j)
    {
        fark[j] = 0;
        --k;
    }
    for(int j = 0; j<nk; ++j)
    {
        ans += fark[j];
    }
    cout<<ans+n;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...