Doors Breaking and Repairing CodeForces - 1102C (思维)

You are policeman and you are playing a game with Slavik. The game is turn-based and each turn consists of two phases. During the first phase you make your move and during the second phase Slavik makes his move.

There are nn doors, the ii-th door initially has durability equal to aiai.

During your move you can try to break one of the doors. If you choose door ii and its current durability is bibi then you reduce its durability to max(0,bi−x)max(0,bi−x) (the value xx is given).

During Slavik's move he tries to repair one of the doors. If he chooses door ii and its current durability is bibi then he increases its durability to bi+ybi+y (the value yyis given). Slavik cannot repair doors with current durability equal to 00.

The game lasts 1010010100 turns. If some player cannot make his move then he has to skip it.

Your goal is to maximize the number of doors with durability equal to 00 at the end of the game. You can assume that Slavik wants to minimize the number of such doors. What is the number of such doors in the end if you both play optimally?

Input

The first line of the input contains three integers nn, xx and yy (1≤n≤1001≤n≤100, 1≤x,y≤1051≤x,y≤105) — the number of doors, value xx and value yy, respectively.

The second line of the input contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1051≤ai≤105), where aiai is the initial durability of the ii-th door.

Output

Print one integer — the number of doors with durability equal to 00 at the end of the game, if you and Slavik both play optimally.

Examples

Input

6 3 2
2 3 1 3 4 2

Output

6

Input

5 3 3
1 2 4 2 3

Output

2

Input

5 5 6
1 2 6 10 3

Output

2

Note

Clarifications about the optimal strategy will be ignored.

题目链接：https://vjudge.net/problem/CodeForces-1102C

题意：给你一个含有N个数的数组，每一个元素代表一个门的当前防御值

每一次你可以对门攻击x个点数，而一个神仙可以对门进行y个点数的防御值提升。

当一次你对门的攻击使这个门的防御值小于等于0的时候，这个门就坏掉了，神仙也没法修复了。

问：当你和神仙都采取最优的策略的时候，你最多可以砸坏几个门？

思路：

分2种情况

1： X>Y ，这样的话，每一个门你都可以给砸坏。（不用解释吧）

2：当x<=y，这样你的最优策略就是每一次去砸那些当前防御值比你的攻击力x值小的门，一次就可以给砸坏，

而神仙的最优策略使去提升那些当前防御值比你的攻击力x值小的门，一次来减少你的数量。

通过样例我们可以推出公式，如果初始化的时候有cnt个门当前防御值比你的攻击力x值小，那么答案就是(ans+1)/2

我的AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#define rep(i,x,n) for(int i=x;i<n;i++)
#define repd(i,x,n) for(int i=x;i<=n;i++)
#define pii pair<int,int>
#define pll pair<long long ,long long>
#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define MS0(X) memset((X), 0, sizeof((X)))
#define MSC0(X) memset((X), '\0', sizeof((X)))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define gg(x) getInt(&x)
using namespace std;
typedef long long ll;
inline void getInt(int* p);
const int maxn=;
const int inf=0x3f3f3f3f;
/*** TEMPLATE CODE * * STARTS HERE ***/
int n,x,y;
int a[maxn];
int main()
{
    gbtb;
    cin>>n>>x>>y;
    repd(i,,n)
    {
        cin>>a[i];
    }
    if(x<=y)
    {
        int ans=;
        repd(i,,n)
        {
            if(a[i]<=x)
            {
                ans++;
            }
        }
        ans=(ans+)/;
        cout<<ans<<endl;
    }else
    {
        cout<<n<<endl;
    }
    return ;
}

inline void getInt(int* p) {
    char ch;
    do {
        ch = getchar();
    } while (ch == ' ' || ch == '\n');
    if (ch == '-') {
        *p = -(getchar() - '');
        while ((ch = getchar()) >= '' && ch <= '') {
            *p = *p *  - ch + '';
        }
    }
    else {
        *p = ch - '';
        while ((ch = getchar()) >= '' && ch <= '') {
            *p = *p *  + ch - '';
        }
    }
}

MY BLOG:
https://www.cnblogs.com/qieqiemin/