给定数组删除多余允许的相同的数

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
//int removeDuplicates(int A[],int n,int count)
//{
// if(A==NULL||n<=0)
// return -1;
// sort(A,A+n);
// for(int i=0;i<n;++i)
// cout<<A[i]<<" ";
// cout<<endl;
// int index=count;
// for(int i=count;i<n;++i)
// {
// if(A[i]!=A[index-count])
// A[index++]=A[i];
// }
// for(int i=0;i<index;++i)
// cout<<A[i]<<" ";
// cout<<endl;
// return index;
//}
int removeDuplicates(vector<int> vec,int count)
{
if(vec.empty()||count>vec.size())
return -1;
sort(vec.begin(),vec.end());
for(auto i:vec)
cout<<i<<" ";
cout<<endl;
int index=count;
for(size_t i=count;i<vec.size();++i)
if(vec[i]!=vec[index-count])
vec[index++]=vec[i];
for(int i=0;i<index;++i)
cout<<vec[i]<<" ";
return index;
}


int main()
{
//int A[]={1,1,1,2,2,3};

///*int n=sizeof(A)/sizeof(A[0]);
//cout<<"请输入最多允许重复次数:";
//int count=0;
//cin>>count;
//cout<<removeDuplicates(A,n,count)<<endl;
//return 0;*/
vector<int> vec;
int elem;
while(cin>>elem)
{
if(elem==-1)
break;
vec.push_back(elem);
}
cout<<"请输入最多允许重复次数:";
int count=1;
cin>>count;
cout<<endl;
cout<<removeDuplicates(vec,count)<<endl;
return 0;
}