mirror of
https://github.com/wczffl-503/OI-Codes.git
synced 2025-07-07 18:06:58 +08:00
Add FZOI Codes
This commit is contained in:
37
FZOI/「201912bronze」三值排序.cpp
Normal file
37
FZOI/「201912bronze」三值排序.cpp
Normal file
@ -0,0 +1,37 @@
|
||||
#include <iostream>
|
||||
using namespace std;
|
||||
#define maxn 1000+5
|
||||
int a[maxn];
|
||||
int main()
|
||||
{
|
||||
int N,num1,num2,num3,sum1,sum2,sum3;
|
||||
cin>>N;
|
||||
num1=num2=num3=sum1=sum2=sum3=0;
|
||||
for(int i=0;i<N;i++)
|
||||
{
|
||||
cin>>a[i];
|
||||
if(a[i]==1)
|
||||
num1++;
|
||||
else if(a[i]==2)
|
||||
num2++;
|
||||
else num3++;
|
||||
}
|
||||
for(int i=0;i<num1;i++)
|
||||
{
|
||||
if(a[i]!=1)
|
||||
sum1++;
|
||||
}
|
||||
for(int i=num1;i<num1+num2;i++)
|
||||
{
|
||||
if(a[i]==3)
|
||||
sum2++;
|
||||
}
|
||||
for(int i=num1+num2;i<N;i++)
|
||||
{
|
||||
|
||||
if(a[i]==2)
|
||||
sum3++;
|
||||
}
|
||||
cout<<sum1+max(sum2,sum3)<<endl;
|
||||
return 0;
|
||||
}
|
Reference in New Issue
Block a user