Submission #1018287

#TimeUsernameProblemLanguageResultExecution timeMemory
1018287AlgorithmWarriorStove (JOI18_stove)C++14
100 / 100
35 ms2140 KiB
#include <bits/stdc++.h> #define MAX 100005 using namespace std; int t[MAX]; int dif[MAX]; bool crt(int a,int b) { return a>b; } int main() { int n,k; cin>>n>>k; int i; for(i=1;i<=n;++i) cin>>t[i]; int total=t[n]-t[1]+1; for(i=1;i<n;++i) dif[i]=t[i+1]-t[i]-1; sort(dif+1,dif+n,crt); for(i=1;i<k;++i) total-=dif[i]; cout<<total; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...