제출 #1276892

#제출 시각아이디문제언어결과실행 시간메모리
1276892kolpo0210Stove (JOI18_stove)C++20
0 / 100
1 ms568 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, k; cin >> n >> k; vector<int>v(n); for(int i=0; i<n; i++) cin >> v[i]; sort(v.begin(), v.end()); if(n==k) { cout << n; return 0; } if(k==1) { cout << (v[n-1]+1)-v[0]; return 0; } vector<int>ans; int x=0; for (int i=0;i<(n); ++i) { if(v[i+1]-v[i]==1) continue; int tmp = (v[i]+1)-v[x]; ans.push_back(tmp); x=i+1; } int sum=0; for(auto i:ans) { sum+=i; } int z = ans.size(); int y = abs(k-z); cout << sum+y; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...