Submission #792928

#TimeUsernameProblemLanguageResultExecution timeMemory
792928naneosmicStove (JOI18_stove)C++14
100 / 100
47 ms2260 KiB
#include <bits/stdc++.h>
using namespace std;
bool p(int a, int b){
if(a>b)return true;
return false;
}
int main(){
    int n,k;
    cin>>n>>k;
    vector<int>vrijeme;
    vector<int>razmak;
    int a;
    cin>>a;
    vrijeme.push_back(a);
    int prosli=a+1;
    for(int i=0;i<n-1;i++){
        cin>>a;
        vrijeme.push_back(a);
        razmak.push_back(a-prosli);
        prosli=a+1;
    }
    sort(razmak.begin(),razmak.end(), p);
    int maks=vrijeme[n-1]+1-vrijeme[0];
    k--;
    for(int i=0;i<k;i++){
        maks-=razmak[i];
    }
    cout<<maks;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...