Submission #537484

#TimeUsernameProblemLanguageResultExecution timeMemory
537484andrei_boacaStove (JOI18_stove)C++14
100 / 100
62 ms2744 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; ll n,v[100005],k; vector<int> vals; int main() { cin>>n>>k; for(int i=1;i<=n;i++) cin>>v[i]; sort(v+1,v+n+1); for(int i=1;i<n;i++) vals.push_back(v[i]-v[i+1]); sort(vals.begin(),vals.end()); ll suma=0; for(int j=0;j+1<k;j++) suma+=vals[j]; suma+=k; suma-=v[1]; suma+=v[n]; cout<<suma; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...