USCAO 2.1.3
来源:互联网 发布:js获取文件大小 编辑:程序博客网 时间:2024/05/20 11:19
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
freopen("sort3.in","r",stdin);
freopen("sort3.out","w",stdout);
int n,a[4],b[1001],cont[4],x;
memset(cont,0,sizeof(cont));
a[1]=a[2]=a[3]=0;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>x;
cont[x]++;
b[i]=x;
}
int temp=cont[1]+cont[2];
for(int i=1;i<=temp;i++)
{
if(b[i]==3)
a[3]++;
else if(b[i]==1&&i>cont[1])
a[1]++;
else if(b[i]==2&&i<=cont[1])
a[2]++;
}
int ans=a[3]+(a[1]>a[2]?a[1]:a[2]);
cout<<ans<<endl;
return 0;
}
- USCAO 2.1.3
- USCAO 2.1.2
- USCAO 2.1.4
- USCAO 2.1.5
- USCAO 2.2.3
- USCAO 2.3.3
- USCAO 2.4.3
- USCAO 3.1.3
- USCAO 3.2.3
- USCAO section1.3 Barn Repair
- USCAO section1.3 Prime Cryptarithm(感觉思路挺好)
- uscao--camelot
- USCAO 题解
- USCAO 热浪
- USCAO Chap4 Fence Loops
- uscao 3.2 Sweet Butter
- USCAO section 1.1 Transformations
- uscao Superprime Rib
- bash
- 架构分析—LinkedIn出品的databus
- Java实现多线程同步
- 使用Kinect驱动OGRE顶点动画的实现
- USCAO 2.1.2
- USCAO 2.1.3
- POJ 1101
- POJ 1125
- USCAO 2.1.4
- 柳传志西电演讲语录
- USCAO 2.1.5
- java中的equals()方法和hashCode()方法详解
- Vim的强大之处
- 数据结构的基本知识及常见试题