Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <map>
- #include <cmath>
- #include <algorithm>
- using namespace std;
- int main(){
- int n, k;
- cin>>n>>k;
- vector <int> a(n);
- map <int, int> c;
- for (int i=0; i<n; i++){
- cin>>a[i];
- c[a[i]]+=1;
- }
- vector <int> answer;
- for (auto x:c){
- if (x.second>=k){
- answer.push_back(x.second-k);
- }else{
- vector <int> b(n);
- for (int i=0; i<n; i++){
- b[i]=abs(a[i]-x.first);
- }
- sort(b.begin(), b.end());
- int sum=0;
- for (int i=0; i<=k-x.second; i++){
- sum+=b[i];
- }
- answer.push_back(sum);
- }
- }
- int minimum=answer[0];
- for (int i=0; i<answer.size(); i++){
- if (answer[i]<minimum){
- minimum=answer[i];
- }
- }
- cout<<minimum<<endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement