제출 #346559

#제출 시각아이디문제언어결과실행 시간메모리
346559PetyStove (JOI18_stove)C++14
100 / 100
67 ms2280 KiB
#include <bits/stdc++.h> using namespace std; int n, t, a[100002], ans; int main() { cin >> n >> t; vector<int>gap; for (int i = 1; i <= n; i++) { cin >> a[i]; if (i > 1) gap.push_back(a[i] - a[i - 1] - 1); } ans = a[n]; sort(gap.begin(), gap.end(), greater<int>()); for (int i = 0; i < t - 1; i++) ans -= gap[i]; cout << ans - a[1] + 1; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...