Submission #1301647

#TimeUsernameProblemLanguageResultExecution timeMemory
1301647jankraszewskiStove (JOI18_stove)C++20
100 / 100
35 ms1196 KiB
#include <bits/stdc++.h> using namespace std; int main() { long long akt,n,k,akt1,akt2,i; cin >> n >> k; vector<long long>odl(n-1); cin >> akt; for(i=0;i<n-1;++i){ cin >> akt1; odl[i]=akt1-akt; akt=akt1; } sort(odl.begin(),odl.end()); long long wyn=n; akt=n-k; for(i=0;i<akt;++i){ wyn+=odl[i]-1; } cout << wyn; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...