제출 #957834

#제출 시각아이디문제언어결과실행 시간메모리
957834Rolo678Stove (JOI18_stove)C++14
100 / 100
37 ms2388 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n,k;
    cin >> n >> k;
    vector<int>t(n+1);
    vector<int>d(n+1);
    for(int i = 1; i <=n;i++)
    {
        cin >> t[i];
    }
     for(int i = 2; i <=n;i++)
    {
        d[i] = t[i] -t[i-1]-1;
    }

    sort(d.begin(),d.end());
    int ans = t[n] - t[1] +1;
     for(int i = n; i > n- k+1; i--) {
        ans -= d[i];
    }
    cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...