CodeForces 600B 二分

输入数组A和B，要求输出数组A中比B[i]小的数的个数。

感受：做的时候想想暴力肯定超时，然后就预处理，谁知开错了数组，runtime error， 数组访问越界的错误，才知道开错了内存。然后就想着另开数组分别保存位置和数量，最后直接搜索求解，这种方法也不好，非正解。队长教的。用二分：upper_bound（A， A+N,  B[i]）- A；返回大于B[i]按照正序应存放的地址，取地址后是下标。

Description

You are given two arrays of integers a and b. For each element of the second array b_j you should find the number of elements in array a that are less than or equal to the value b_j.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 2·10⁵) — the sizes of arrays a and b.

The second line contains n integers — the elements of array a ( - 10⁹ ≤ a_i ≤ 10⁹).

The third line contains m integers — the elements of array b ( - 10⁹ ≤ b_j ≤ 10⁹).

Output

Print m integers, separated by spaces: the j-th of which is equal to the number of such elements in array a that are less than or equal to the value b_j.

Sample Input

Input

5 4
1 3 5 7 9
6 4 2 8

Output

3 2 1 4

Input

5 5
1 2 1 2 5
3 1 4 1 5

Output

4 2 4 2 5

AC代码：
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cstring>
using namespace std;
//#define LOCAL
#define MAX_N 200000

int A[MAX_N], B[MAX_N];

int main()
{
	#ifdef LOCAL
		freopen("b:\\data.in.txt", "r", stdin);
	#endif

    int n, m;
    scanf("%d%d", &n, &m);
    for(int i=0; i<n; i++)
        scanf("%d", &A[i]);
    sort(A, A+n);
    int t;
    for(int i=0; i<m; i++)
    {
        scanf("%d", &t);
        cout<<upper_bound(A, A+n, t) - A<<" ";
    }
    cout<<endl;

    return 0;
}