Queries about less or equal elements （lower_bound与upper_bound）

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

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

The second line contains n integers — the elements of array a ( - 109 ≤ ai ≤ 109).

The third line contains m integers — the elements of array b ( - 109 ≤ bj ≤ 109).

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 bj.

Example
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

对于upper_bound来说，返回的是被查序列中第一个大于查找值的指针，也就是返回指向被查值>查找值的最小指针，lower_bound则是返回的是被查序列中第一个大于等于查找值的指针，也就是返回指向被查值>=查找值的最小指针。

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <iostream>
#include <map>
#define Mod  20170825
#define INF 0x3f3f3f3f
#define mn 1324565
using namespace std;
int a[213121];
int b[324324];
int ans[235111];
int main()
{
    int n, m;
    scanf("%d %d", &n, &m);
    for(int i=0;i<n;i++)
    {
        scanf("%d", &a[i]);
    }
    for(int i=0;i<m;i++)
    {
        scanf("%d", &b[i]);
    }
    sort(a, a+n);//排序
    for(int i=0;i<m;i++)
    {
        ans[i] = upper_bound(a, a+n, b[i])-a;//记录个数
    }
    for(int i=0;i<m;i++)
    {
        if(i==0)
            printf("%d", ans[i]);
        else
            printf(" %d", ans[i]);
    }
    printf("\n");
    return 0;
}