제출 #127327

#제출 시각아이디문제언어결과실행 시간메모리
127327lamkhanhStove (JOI18_stove)C++17
100 / 100
83 ms2224 KiB
#include<bits/stdc++.h> using namespace std; int n, k, i, timego[100002], kc[100002]; int main(){ cin >> n >> k; if(n==k){ cout << n; return 0; } else{ for(i=1;i<=n;i++) cin >> timego[i]; for(i=1;i<n;i++) kc[i] = timego[i+1] - timego[i] - 1; sort(kc+1, kc+n); int ans = n; for(i=1;i<n-k+1;i++) ans += kc[i]; cout << ans; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...