Codeforces Round #294 (Div. 2)C - A and B and Team Training 水题

C. A and B and Team Training

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A and B are preparing themselves for programming contests.

An important part of preparing for a competition is sharing programming knowledge from the experienced members to those who are just beginning to deal with the contests. Therefore, during the next team training A decided to make teams so that newbies are solving problems together with experienced participants.

A believes that the optimal team of three people should consist of one experienced participant and two newbies. Thus, each experienced participant can share the experience with a large number of people.

However, B believes that the optimal team should have two experienced members plus one newbie. Thus, each newbie can gain more knowledge and experience.

As a result, A and B have decided that all the teams during the training session should belong to one of the two types described above. Furthermore, they agree that the total number of teams should be as much as possible.

There are n experienced members and m newbies on the training session. Can you calculate what maximum number of teams can be formed?

Input

The first line contains two integers n and m (0 ≤ n, m ≤ 5·10⁵) — the number of experienced participants and newbies that are present at the training session.

Output

Print the maximum number of teams that can be formed.

Sample test(s)

Input

2 6

Output

2

Input

4 5

Output

3

Note

Let's represent the experienced players as XP and newbies as NB.

In the first test the teams look as follows: (XP, NB, NB), (XP, NB, NB).

In the second test sample the teams look as follows: (XP, NB, NB), (XP, NB, NB), (XP, XP, NB).

题意：给你Ｎ个Ａ类人和Ｍ个Ｂ类人

他们可以组队，组队方式有两种，２个Ａ和一个Ｂ，２个Ｂ和一个Ａ这样子组队

然后问你最多可以组多少对

题解：暴力模拟组队就好了……每次选择少的那类人派出一个人就好

//qscqesze

#include <cstdio>

#include <cmath>

#include <cstring>

#include <ctime>

#include <iostream>

#include <algorithm>

#include <set>

#include <vector>

#include <sstream>

#include <queue>

#include <typeinfo>

#include <fstream>

#include <map>

typedef long long ll;

using namespace std;

//freopen("D.in","r",stdin);

//freopen("D.out","w",stdout);

#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)

#define maxn 100001

#define eps 1e-9

const int inf=0x7fffffff;   //无限大

int main()

{

        int ans=0;

        int n,m;

        cin>>n>>m;

        while(1)

        {

                if(n<2&&m<2||n==0||m==0)

                        break;

                if(n<m)

                {

                        n-=1;

                        m-=2;

                        ans++;

                }

                else

                {

                        m-=1;

                        n-=2;

                        ans++;

                }

        }

        cout<<ans<<endl;

}