Submission #337094

#TimeUsernameProblemLanguageResultExecution timeMemory
337094deadeyeStove (JOI18_stove)C++14
100 / 100
30 ms3328 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define fi first #define si second typedef pair<int,int> pi; #ifdef LOCAL #define debug(...) __f(#__VA_ARGS__, __VA_ARGS__) #else #define debug(...) 69 #endif template <typename Arg> void __f(string name, Arg arg) { cerr << name << " = " << arg << endl; } template <typename Head, typename... Tail> void __f(string names, Head head, Tail... tail) { string cur = ""; for (auto ch: names){if(ch==','){break;}else{cur+=ch;}} string nxt = names.substr(cur.size()+2); cerr << cur << " = " << head << ", "; __f(nxt, tail...); } const int mxn = 100005; int N, K, A[mxn], ans, idx = 1; vector<int> d; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> N >> K; for (int i = 1; i <= N; ++i) cin >> A[i]; for (int i = 2; i <= N; ++i) d.pb(A[i] - A[i - 1] - 1); sort(d.begin(), d.end(), greater<int>()); ans = A[N] - A[1] + 1; for (int i = 0; i < K - 1; ++i) { ans -= d[i]; } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...