# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
810855 | mdacode | Stove (JOI18_stove) | C++14 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include<algorithm>
using namespace std;
int main(){
long long nbi,k;
cin >> nbi >> k;
vector<long long>dif;
long long firv,fir,sec,tot=0;
cin >> fir;
firv=fir;
for(long long i=0;i<nbi-1;i++){
cin >> sec;
dif.push_back(sec-(fir+1));
fir=sec;
}
sort(dif.begin(),dif.end());
long long res=(sec+1)-firv;
for(long long j=nbi-2;j>=nbi-k;j--){
res-=dif[j];
}
cout << res;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |