一个，我只做对60%
算法如下（自编算法）
```cpp
#include<iostream>
#include<cstring>
using namespace std;
int a[10001],b[10001],c[10001],d[10001];
int main()
{
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
memset(c,0,sizeof(c));
memset(d,0,sizeof(d));
int n,i,j,k=0,s=0,s1=0,s2=0;//s2==结果
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i]>>b[i];
c[a[i]]++;
if(c[a[i]]>s)
{
s=c[a[i]];
s1=a[i];//s1 为最多花色
}
}
for(i=1;i<=n;i++)
{
if(a[i]==s1)
if(d[b[i]]==0) d[b[i]]++;
else s2++;
}
k=n-s;
s2+=k;
cout<<s2<<endl;
return 0;
}
```
by KasuganoYamato @ 2017-07-26 10:27:44