Algorithm

B. Queries about less or equal elements
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem link- https://codeforces.com/contest/600/problem/B
input
standard input
output
standard output

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.

Examples
input
Copy
5 4
1 3 5 7 9
6 4 2 8
output
Copy
3 2 1 4
input
Copy
5 5
1 2 1 2 5
3 1 4 1 5
output
Copy
4 2 4 2 5



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 2 * 1e5;
int arr[N] = {0};

int main() {
	int n, m;
	cin >> n >> m;

	for(int i = 0; i < n; i++)
		cin >> arr[i];
	sort(arr, arr+n);

	for(int i = 0; i < m; i++) {
		int tmp;
		cin >> tmp;
		cout << upper_bound(arr, arr+n, tmp) - arr << endl;
	}

	return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
5 4
1 3 5 7 9
6 4 2 8

Output

x
–
+
cmd
3 2 1 4
Advertisements

Demonstration

Codeforces Solution-Queries about less or equal elements-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+