INTERESTING DRINK

• Problem Description

  
  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 (1n100000) the number of shops in the city that sell Vasiliys favourite drink. The second line contain integers xi (1xi100000) 
  prices of the bottles of the drink in the i-th shop.The third line contains a single integer q (1q100000) the number of days Vasiliy plans to buy the drink.Then follow q lines each containing one integer mi (1mi109) 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.
  

• CODING ARENA

• #include <stdio.h>

  int a[100010];

  int main()

  {

    int A[100001]={},n,m,i,j;

    scanf("%d",&n);

    for(i=1;i<=n;i++)

    {

      scanf("%d",&j);

      A[j]++;

    }

    for(i=1;i<100000;i++)

    {

      A[i]+=A[i-1];

    }

    scanf("%d",&m);

    for(i=0;i<m;i++)

    {

      scanf("%d",&j);

      if(j>100000)

        j=100000;

      printf("%d\n",A[j]);

    }

    return 0;

  }

• Test Case 1

  
  Input (stdin)

  5
  
  3 10 8 6 11
  
  4
  
  1 10 3 11
  
  

  Expected Output

  0
  
  4
  
  1
  
  5

• Test Case 2

  
  Input (stdin)

  3
  
  2 1 3
  
  3
  
  2 4 1
  
  

  Expected Output

  2
  
  3
  
  1