SDUT-Queries about less or equal elements(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.

输入

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

输出

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.

输入样例

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

-------------------------------------------------------------

暴力T的代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
   int n, m;
   ll a[200050], b[200050], c[200050];
   scanf("%d %d", &n, &m);
   for(int i=1;i<=n;i++)
   {
     scanf("%lld", &a[i]);
   }
   for(int i=1;i<=m;i++)
   {
     scanf("%lld", &b[i]);
   }
   int ans, k=0;
   for(int i=1;i<=m;i++)
   {
       ans = 0;
      for(int j=1;j<=n;j++)
      {
         if(a[j]<=b[i])
         {
            ans++;
         }
      }
      c[k++] = ans;
   }
   for(int i=0;i<k;i++)
   {
      if(i==k-1) printf("%d\n", c[i]);
      else printf("%d ", c[i]);
   }
   return 0;
}

ac代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
   int n, m;
   int a[200050], b[200050];
   while(~scanf("%d %d", &n, &m))
   {
   for(int i=0;i<n;i++)
   {
     scanf("%d", &a[i]);
   }
   for(int j=0;j<m;j++)
   {
     scanf("%d", &b[j]);
   }
   sort(a, a+n);
   for(int i=0;i<m;i++)
   {
      if(i==m-1) printf("%d\n", upper_bound(a, a+n, b[i])-a);
      else printf("%d ", upper_bound(a, a+n, b[i])-a);
   }
   }
   return 0;
}