제출 #754623

#제출 시각아이디문제언어결과실행 시간메모리
754623otariusStove (JOI18_stove)C++17
100 / 100
54 ms1316 KiB
#include <bits/stdc++.h> using namespace std; #define ff first #define sc second #define pb push_back #define ll long long #define pii pair<int, int> const ll mod = 1e9 + 7; void solve() { int n, k; cin >> n >> k; int arr[n + 1]; for (int i = 1; i <= n; i++) cin >> arr[i]; vector<int> vals; sort(arr + 1, arr + n + 1); for (int i = 2; i <= n; i++) vals.pb(arr[i] - arr[i - 1]); int ans = 0; sort(vals.begin(), vals.end()); for (int i = 0; i < n - k; i++) ans += vals[i]; cout << ans + k; } int main() { int t = 1; // cin >> t; while (t--) { solve(); cout << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...