Submission #978263

#TimeUsernameProblemLanguageResultExecution timeMemory
978263wateronennStove (JOI18_stove)C++14
0 / 100
0 ms348 KiB
#include<bits/stdc++.h> using namespace std; const int N = 1e5+9; int arr[N]; int main(){ cin.tie(0)->sync_with_stdio(false); int n,k; cin>>n>>k; for(int i=1;i<=n;i++){ cin>>arr[i]; } priority_queue<int> pq; sort(arr+1,arr+n+1); int all = arr[n]+1; for(int i=1;i<=n;i++) { cout<<arr[i]-arr[i-1]-1<<" "; pq.push(arr[i]-arr[i-1]-1); } for(int i=1;i<=k-1;i++){ all-=pq.top(); pq.pop(); } cout<<all-1; return 0; } /* 3 1 1 3 6 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...