LintCode_248 Count of Smaller Number

Give you an integer array (index from 0 to n-1, where n is the size of this array, value from 0 to 10000) and an query list. For each query, give you an integer, return the number of element in the array that are smaller than the given integer.

 Notice

We suggest you finish problem Segment Tree Build and Segment Tree Query II first.

Have you met this question in a real interview? 

Yes

Example

For array [1,2,7,8,5], and queries [1,8,5], return [0,4,2]

Challenge 

Could you use three ways to do it.

1. Just loop
2. Sort and binary search
3. Build Segment Tree and Search.

   class Solution {
   public:
      /**
        * @param A: An integer array
        * @return: The number of element in the array that 
        *          are smaller that the given integer
        */
       vector<int> countOfSmallerNumber(vector<int> &A, vector<int> &queries) {
           // write your code here
           sort(A.begin(), A.end());
           vector<int> res;
           for (int i = 0; i < queries.size(); i++) {
               auto itr = lower_bound(A.begin(), A.end(), queries[i]);
               int count = itr - A.begin();
               res.push_back(count);
           }
           return res;
       }
   };