codeforces 825C (Multi-judge Solving)

time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Makes solves problems on Decoforces and lots of other different online judges. Each problem is denoted by its difficulty — a positive integer number. Difficulties are measured the same across all the judges (the problem with difficulty d on Decoforces is as hard as the problem with difficulty d on any other judge).

Makes has chosen n problems to solve on Decoforces with difficulties a1, a2, …, an. He can solve these problems in arbitrary order. Though he can solve problem i with difficulty ai only if he had already solved some problem with difficulty (no matter on what online judge was it).

Before starting this chosen list of problems, Makes has already solved problems with maximum difficulty k.

With given conditions it’s easy to see that Makes sometimes can’t solve all the chosen problems, no matter what order he chooses. So he wants to solve some problems on other judges to finish solving problems from his list.

For every positive integer y there exist some problem with difficulty y on at least one judge besides Decoforces.

Makes can solve problems on any judge at any time, it isn’t necessary to do problems from the chosen list one right after another.

Makes doesn’t have too much free time, so he asked you to calculate the minimum number of problems he should solve on other judges in order to solve all the chosen problems from Decoforces.
Input

The first line contains two integer numbers n, k (1 ≤ n ≤ 103, 1 ≤ k ≤ 109).

The second line contains n space-separated integer numbers a1, a2, …, an (1 ≤ ai ≤ 109).
Output

Print minimum number of problems Makes should solve on other judges in order to solve all chosen problems on Decoforces.
Examples
Input

3 3
2 1 9

Output

1

Input

4 20
10 3 6 3

Output

0

Note

In the first example Makes at first solves problems 1 and 2. Then in order to solve the problem with difficulty 9, he should solve problem with difficulty no less than 5. The only available are difficulties 5 and 6 on some other judge. Solving any of these will give Makes opportunity to solve problem 3.

In the second example he can solve every problem right from the start.

题意不是很明显，比赛时完全没搞懂，后来才看明白，就是给你n个问题，每一个问题的难度是ai，然后只有你已经解决的问题的最大难度d 满足 d >= ai/2 你才能解决这个问题，你最开始已经解决的难度是k，你可以从其他oj上解决问题增加你的d，问你需要从其他oj最少做多少题，才可以解决列表中的全部问题。

题意搞懂后就比较简单了，肯定是先按难度排序嘛，然后如果不符合2*k > ai就对k*=2即在其他oj做了一个2*k难度的问题，然后再统计一下次数就可以了，最后每做完一道题要更新一下k

代码如下：

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;
const int MAX = 1010;
int a[MAX],k,n;
int solve(){
    int Count = 0;
    for(int i=1;i<=n;i++){
        while(2*k < a[i]){
            k *= 2;
            Count++;
        }
        k = max(k,a[i]);
    }
    return Count;
}
int main(void){
    scanf("%d %d",&n,&k);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+1+n);
    printf("%d",solve());
    return 0;
}