A. Splitting in Teams(贪心)

来源:互联网 发布:sql端口号是多少 编辑:程序博客网 时间:2024/04/19 19:08

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 training contest. A group is either one person who can write the contest with anyone else, 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 is possible that he can't use all groups to form teams. For groups of two, either both students should write the contest, or both should not. If two students from 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 of groups.

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

Output

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

Examples
input
41 1 2 1
output
1
input
22 2
output
0
input
72 2 2 1 1 1 1
output
3
input
31 1 1
output
1
Note

In the first example the coach can form one team. For example, he can take students 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 can do 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).



思路:

先组合2,有一个2就需要一个1,然后计算完所有的2之后,就在计算1的个数,用1的个数除于3即为可组成的个数。

代码:

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int main(){    ios::sync_with_stdio(false);    int n,x;    int c1=0,c2=0;    cin>>n;    for(int i=1;i<=n;i++){        cin>>x;        if(x==1)        c1++;        else if(x==2)        c2++;    }    int t=min(c1,c2);    c1-=t;    c2-=t;    t=t+c1/3;    cout<<t<<endl;    return 0;}


原创粉丝点击