Submission #1122632

#TimeUsernameProblemLanguageResultExecution timeMemory
1122632SulAStove (JOI18_stove)C++20
100 / 100
17 ms828 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/tree_policy.hpp> #include <ext/pb_ds/assoc_container.hpp> //#pragma GCC target("popcnt") using namespace __gnu_pbds; using namespace std; using ordered_set = tree<int, null_type, less_equal<>, rb_tree_tag, tree_order_statistics_node_update>; #define popcount __builtin_popcountll signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n,k; cin >> n >> k; int t[n]; for (int i = 0; i < n; cin >> t[i++]); int ans = t[n-1] - t[0] + 1; for (int i = 0; i < n-1; t[i] = t[i+1] - t[i] - 1, i++); sort(t, t + n-1, greater<>()); for (int i = 0; i < k-1; i++) ans -= t[i]; cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...