5.29/E题

Description

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 Input

Input

2 6

Output

2

Input

4 5

Output

3

Hint

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).

题目大意，输入两个数，n和m，n代表老队员数，m代表新队员数，共有两种组合可供选择，一种是一个老队员带两个新队员，一种是两个老队员带一个新队员，问最多可以有多少个队伍的组合数

嗯，直接打暴力，但kkkiller是用线性规划做的，实在佩服啊。

附上代码

#include <cstdio>
int main()
{
   int m,n,ans;
   scanf("%d%d",&m,&n);
   ans=0;
   while ((m>=1 && n>=2) || (m>=2 && n>=1))
   {
       if (m<n)
       {
           m--;
           n=n-2;
           ans++;
           //printf("1 %d\n",ans);
       }
       else
       {
           m=m-2;
           n--;
           ans++;
           //printf("2 %d\n",ans);
       }
   }
   printf("%d\n",ans);
    return 0;
}