Submission #1310658

#TimeUsernameProblemLanguageResultExecution timeMemory
1310658syanvuStove (JOI18_stove)C++20
100 / 100
14 ms2368 KiB
// #pragma optimize ("g",on) // #pragma GCC optimize ("inline") // #pragma GCC optimize ("Ofast") // #pragma GCC optimize ("unroll-loops") // #pragma GCC optimize ("03") #include <bits/stdc++.h> #define pb push_back #define SS ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr); #define int long long #define all(v) v.begin(),v.end() using namespace std; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); const int N = 4e5 + 1, inf = 1e9 + 1, mod = 998244353; void solve(){ int n, k; cin >> n >> k; int t[n + 1]; int ans = n; for(int i = 1; i <= n; i++){ cin >> t[i]; } vector<int> v; for(int i = 1; i < n; i++){ v.push_back(t[i + 1] - t[i] - 1); } sort(all(v)); k = n - k; for(int i = 0; i < k; i++){ ans += v[i]; } cout << ans; } signed main(){ SS // freopen("trains.in", "r", stdin); // freopen("trains.out", "w", stdout); 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...