Queries about less or equal elements CodeForces - 600B(二分)

标签：color   clu   mes   tmp   sep   fir   vector   tle   c++   

You are given two arrays of integers a and b. For each element of the second arrayb_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 aand 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.

Examples

5 4
1 3 5 7 9
6 4 2 8

3 2 1 4

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

4 2 4 2 5

排个序 二分即可 
upper_bound即可

#include <bits/stdc++.h>
using namespace std;
vector<int> g;
vector<int> v;

int main()
{
    int n, m;
    cin>> n >> m;
    for(int i=0; i<n; i++)
    {
        int tmp;
        cin>> tmp;
        v.push_back(tmp);
    }
    for(int i=0; i<m; i++)
    {
        int tmp;
        cin>> tmp;
        g.push_back(tmp); 
    }
    sort(v.begin(), v.end());
    int len = g.size();
    for(int i=0; i<len; i++)
    {
        if(i!=0)
            cout<< " ";
        cout<< upper_bound(v.begin(), v.end(), g[i]) - v.begin();
    }
    cout<<endl;
    
    
    return 0;
} 

Queries about less or equal elements CodeForces - 600B(二分)

标签：color   clu   mes   tmp   sep   fir   vector   tle   c++   

原文地址：https://www.cnblogs.com/WTSRUVF/p/9603726.html