B. Interesting drink
Vasiliy likes to rest after a hard work, so you may often meet him in some bar nearby. As all programmers do, he loves the famous drink “Beecola”, which can be bought in n different shops in the city. It’s known that the price of one bottle in the shop i is equal to x i coins.
Vasiliy plans to buy his favorite drink for q consecutive days. He knows, that on the i-th day he will be able to spent m i coins. Now, for each of the days he want to know in how many different shops he can buy a bottle of “Beecola”.
Input
The first line of the input contains a single integer n (1?≤?n?≤?100?000) — the number of shops in the city that sell Vasiliy’s favourite drink.
The second line contains n integers x i (1?≤?x i?≤?100?000) — prices of the bottles of the drink in the i-th shop.
The third line contains a single integer q (1?≤?q?≤?100?000) — the number of days Vasiliy plans to buy the drink.
Then follow q lines each containing one integer m i (1?≤?m i?≤?109) — the number of coins Vasiliy can spent on the i-th day.
Output
Print q integers. The i-th of them should be equal to the number of shops where Vasiliy will be able to buy a bottle of the drink on the i-th day.
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cmath>
using namespace std;
int Comp(const void*a, const void*b)
{return *(int*)a - *(int*)b;
}
int max(int a, int b)
{if (a > b){return a;}return b;
}
int main()
{int x[100001] = { 0 };int n, q, m;cin >> n;for (int i = 0; i < n; i++){cin >> x[i];}qsort(x, n, sizeof(int), Comp);cin >> q;while (q--){cin >> m;if (m < x[0]){cout << 0 << endl;}else if (m > x[n - 1]){cout << n << endl;}else{int high = n - 1, low = 0, mid;int index = 0;while (low <=high){mid = (high + low) / 2;if (x[mid] <= m){index = mid;low = mid + 1;}else{high = mid - 1;}}cout << index + 1 << endl;}}return 0;
}