제출 #1290471

#제출 시각아이디문제언어결과실행 시간메모리
1290471kerim_cavusoglu44Stove (JOI18_stove)C++20
100 / 100
16 ms2372 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n,k;cin>>n>>k; vector<long long> kerim(n); vector<long long> bosluklar; for(int i=0;i<n;i++)cin>>kerim[i]; for(int i=1;i<n;i++){ long long bosluk=kerim[i]-(kerim[i-1]+1); bosluklar.push_back(bosluk); } sort(bosluklar.rbegin(),bosluklar.rend()); long long tot=kerim[n-1]-kerim[0]+1; for(int i=0;i<k-1&&i<bosluklar.size();i++){ tot-=bosluklar[i]; } cout<<tot<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...