제출 #1287353

#제출 시각아이디문제언어결과실행 시간메모리
1287353bilgunStove (JOI18_stove)C++20
100 / 100
37 ms1436 KiB
#include<bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int> col(n); for( int i = 0; i < n; i++) { cin >> col[i]; } if( n == k) { cout << n << endl; return 0; } vector<int> pref; for( int i = 1; i < n; i++) { pref.push_back(col[i] - col[i - 1]); } sort( pref.begin(), pref.end()); int ans = k; for( int i = 0; i <n-k; i++){ ans += pref[i]; } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...