제출 #1091283

#제출 시각아이디문제언어결과실행 시간메모리
1091283vjudge1Stove (JOI18_stove)C++17
100 / 100
39 ms3544 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int #define pii pair<int , int> const int MAXN = 2e5 + 5; signed main(){ int n,k; cin>>n>>k; vector <int> time; for(int i = 1 ; i <= n ; i++){ int x; cin>>x; time.push_back(x); } sort(time.begin() , time.end()); vector <int> diff; for(int i = 1 ; i < n ; i++){ diff.push_back(time[i] - time[i - 1]); } sort(diff.begin() , diff.end()); int ans = 0; for(int i = 0 ; i < n - k ; i++){ ans += diff[i]; } cout<<ans + k<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...