제출 #1049696

#제출 시각아이디문제언어결과실행 시간메모리
1049696vjudge1Stove (JOI18_stove)C++17
100 / 100
45 ms5500 KiB
#include<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;

#define ll long long

int n,k,a[100001],ans=0;
multiset<int> ma;
      
int main(){
      cin>>n>>k;
      for(int i=0;i<n;i++){
            cin>>a[i];
            if(i>0){
                  ma.insert(-(a[i]-a[i-1]-1));
            }
      }
      ans=a[n-1]-a[0]+1;
      int ck=1;
      for(auto it : ma){
            if(ck>=k)break;
            ck++;
            ans+=it;
      }
      cout<<ans<<endl;
      return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...