Submission #1151746

#TimeUsernameProblemLanguageResultExecution timeMemory
1151746EsgeerStove (JOI18_stove)C++20
100 / 100
14 ms2244 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #ifndef Local #pragma GCC optimize("O3,unroll-loops") #endif #define int long long #define ll long long #define vi vector<int> #define vvi vector<vi> #define pii pair<int, int> #define vpi vector<pii> #define vvpi vector<vpi> #define vb vector<bool> #define vvb vector<vb> #define endl '\n' #define sp <<' '<< #define F(i, s, n) for(int i = s; i < (int) n; i++) #define pb push_back #define fi first #define se second const int mod = 998244353; const int inf = 1e12; const int N = 2e5+5; void solve() { int n, k; cin >> n >> k; vi a(n); F(i, 0, n) cin >> a[i]; sort(a.begin(), a.end()); vi dists; F(i, 1, n) dists.pb(a[i] - a[i-1] - 1); int ans = n; sort(dists.begin(), dists.end()); F(i, 0, n-k) { ans += dists[i]; } cout << ans << endl; } void setIO() { ios_base::sync_with_stdio(0); cin.tie(0); #ifdef Local freopen("local.in", "r", stdin); freopen("local.out", "w", stdout); #else // freopen("friendcross.in","r",stdin); // freopen("friendcross.out","w",stdout); #endif } signed main() { setIO(); int t = 1; //cin >> t; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...