제출 #648195

#제출 시각아이디문제언어결과실행 시간메모리
648195SemjonsFStove (JOI18_stove)C++17
100 / 100
67 ms1312 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; int t[n]; for(auto &x:t){ cin >> x; } sort(t, t+n); int ans = t[n-1]-t[0]+1; vector <int> atn; for(int i = 1; i < n; i++){ atn.push_back(t[i]-t[i-1]-1); } sort(atn.begin(), atn.end(), greater<int>()); for(int i = 0; i < k-1; i++){ ans-=atn[i]; } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...