codeforces 899A Splitting in Teams题解

题目链接:点击打开链接

A. Splitting in Teams

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There were n groups of students which came to write a trainingcontest. A group is either one person who can write the contest with anyoneelse, or two people who want to write the contest in the same team.

The coach decided to form teams of exactly three people for this training.Determine the maximum number of teams of three people he can form. It ispossible that he can't use all groups to form teams. For groups of two, eitherboth students should write the contest, or both should not. If two studentsfrom a group of two will write the contest, they should be in the same team.

Input

The first line contains single integer n (2 ≤ n ≤ 2·105) — the number ofgroups.

The second line contains a sequence of integers a1, a2, ..., an (1 ≤ ai ≤ 2), where ai isthe number of people in group i.

Output

Print the maximum number of teams of three people the coach can form.

Examples

Input

4
1 1 2 1

Output

1

Input

2
2 2

Output

0

Input

7
2 2 2 1 1 1 1

Output

3

Input

3
1 1 1

Output

1

Note

In the first example the coach can form one team. For example, he can takestudents from the first, second and fourth groups.

In the second example he can't make a single team.

In the third example the coach can form three teams. For example, he cando this in the following way:

  • The first group (of two people) and the seventh group (of one person),
  • The second group (of two people) and the sixth group (of one person),
  • The third group (of two people) and the fourth group (of one person).

大意:给定一系列数据(只有1和2)将一个1和一个2组合或者三个1组合,求最大的组合方式可以有多少种。

分析:先把2都和1组合,再判断剩下的1可以组成多少组。(水题)

代码如下:

#include <stdio.h>
#include <string.h>
int main() {
    int n;
    while (scanf("%d",&n) != EOF) {
        int a,count1 = 0, count2 = 0;
        while (n--){
            scanf("%d",&a);
            if (a ==1) count1++;
            else if(a == 2)count2++;
        }
        int countn =count1 < count2 ? count1 : count2;
        if (count1 >count2)
            countn +=(count1 - count2) / 3;
        printf("%d\n",countn);
    }
}


 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值