제출 #277925

#제출 시각아이디문제언어결과실행 시간메모리
277925MKutayBozkurtStove (JOI18_stove)C++14
100 / 100
23 ms1152 KiB
#include <bits/stdc++.h> using namespace std; template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; vector<int> a(n); cin >> a; vector<int> p(n - 1); for (int i = 0; i < n - 1; i++) { p[i] = a[i + 1] - a[i]; } sort(p.begin(), p.end()); // 2 3 // 1 4 // 2 3 // 1 2 5 8 10 k = 2 ans = 8? // 1 2 3 3 int ans = 0; for (int i = 0; i < n; i++) { if (i >= n - k) ans++; else ans += p[i]; } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...