Educational Codeforces Round 2 B. Queries about less or equal elements

B. Queries about less or equal elements

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 test(s)

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

题意：计算出数组中有多少个数小于等于bj（1<=j<=m）。

思路：将两个数组都排序，然后从小到大比较，b[j].len = b[j-1](j>0),这样就可以省去重复比较的时间，最后按照原来数组b的下标从小到大再排序，输出结果。

#include <stdio.h>
#include <algorithm>
using namespace std;
#define maxn 200005
int a[maxn];
struct node
{
    int tp, x, len;
}b[maxn];
bool cmp1(node a, node b)
{
    return a.x < b.x;
}
bool cmp2(node a, node b)
{
    return a.tp < b.tp;
}
int main()
{
    int n, m, i, j;
    scanf("%d %d", &n, &m);
    for(i = 0;i < n;i++) scanf("%d", &a[i]);
    for(i = 0;i < m;i++){
        scanf("%d", &b[i].x);
        b[i].tp = i;
        b[i].len = 0;
    }
    sort(a, a + n);
    sort(b, b + m, cmp1);
    //for(i = 0;i < m;i++) printf("%d%c", b[i].x, i==m-1?'\n':' ');
    j = 0;
    for(i = 0;i < m;i++)
    {
        if(i != 0) b[i].len = b[i - 1].len;
        while(a[j] <= b[i].x&&j < n)
        {
            b[i].len++;
            j++;
        }
    }
    sort(b, b + m, cmp2);
    for(i = 0;i < m;i++) printf("%d%c", b[i].len, i==m-1?'\n':' ');
}