Submission #734060

#TimeUsernameProblemLanguageResultExecution timeMemory
734060LCJLYStove (JOI18_stove)C++14
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> //needa retype template incase bret reynold yeah bruh moment ill me using namespace std; #define int long long typedef pair<int,int>pii; int32_t main(){ ios::sync_with_stdio(0); cin.tie(0); int n,k; cin >> n >> k; int arr[n+5]; for(int x=1;x<=n;x++){ cin >> arr[x]; } priority_queue<int>pq; for(int x=2;x<=n;x++){ pq.push(arr[x]-arr[x-1]-1); } int counter=n; for(int bruh=0; bruh<n-k-1; ++bruh) { auto cur=pq.top(); counter-=cur; pq.pop(); } cout << counter; } /* 10 5 1 2 5 6 8 11 13 15 16 20 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...