codeforces 519C A and B and Team Training

最新推荐文章于 2021-11-12 16:13:20 发布

原创最新推荐文章于 2021-11-12 16:13:20 发布 · 397 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#贪心 #模拟

ACM算法_贪心专栏收录该内容

15 篇文章

订阅专栏

探讨了在编程比赛中如何根据经验成员和新手的数量形成最优团队组合，通过两种不同的团队配置方案实现最大的团队数量。

点击打开链接

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·105) — 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.

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

贪心的思路，但是模拟这个过程就行，找人数多的一方（>=），人多的一方用两个，另一个用一个，这样组一个组，就可以得到有多少组了，这是基本思路，还有不是很清楚的看代码。

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
typedef long long ll;
using namespace std;
const ll mod=100000000;
int main()
{
    int n,m;
    cin>>n>>m;
    int s=0;
    while(1)
    {
        if(n==0||m==0||(n<=1&&m<=1))
            break;
        if(n>=m)
        {
            n-=2;
            m--;
        }
        else
        {
            m-=2;
            n--;
        }
        s++;
    }
    cout<<s<<endl;
    return 0;
}