Interesting drink

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 xi 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 mi 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 xi (1 ≤ xi ≤ 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 mi (1 ≤ mi ≤ 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.

Example
Input
5
3 10 8 6 11
4
1
10
3
11
Output
0
4
1
5
Note
On the first day, Vasiliy won’t be able to buy a drink in any of the shops.

On the second day, Vasiliy can buy a drink in the shops 1, 2, 3 and 4.

On the third day, Vasiliy can buy a drink only in the shop number 1.

Finally, on the last day Vasiliy can buy a drink in any shop.
10 Of 5 The next power , Must think of two points

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define INF 0x3f3f3f3f
int n,dis[100000],f,k;
bool book[2001];
char c[2001][2001];
int main()
{
    
  cin>>n;
  for(int i=0;i<n;i++)
    cin>>dis[i];
    sort(dis,dis+n);
  cin>>f;
  for(int i=1;i<=f;i++)
  {
    
      cin>>k;
      int mid=upper_bound(dis,dis+n,k)-dis;
      cout<<mid<<endl;
  }
    return 0;
}

harm , I haven't used two point search for a long time and forgot
Split template

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define INF 0x3f3f3f3f
int n,dis[100009],f,k;
bool book[2001];
char c[2001][2001];
int main()
{
    
  cin>>n;
  for(int i=1;i<=n;i++)
    cin>>dis[i];
    sort(dis+1,dis+1+n);
  cin>>f;
  for(int i=1;i<=f;i++)
  {
    
      cin>>k;
      int l=1,r=n;
      int mid;
      while(l<=r)
      {
    
           mid=(r+l)/2;
          if(dis[mid]>k)
            r=mid-1;
          else
            l=mid+1;
               //cout<<l<<r<<mid<<endl;
    }
      cout<<l-1<<endl;
  }
    return 0;
}