Consultas de mayor que y no menor que

Dada una array de N enteros. Habrá Q consultas, cada una incluye dos enteros de forma q y x , 0 <= q <= 1. Las consultas son de dos tipos: 
 

• En la primera consulta (q = 0), la tarea es encontrar el número de enteros que no sean menores que x (O mayores o iguales que x). 
   
• En la segunda consulta (q = 1), la tarea es encontrar el número de enteros mayores que x. 
   

Ejemplos: 
 

// C++ to find number of integer less or greater given
// integer queries
#include<bits/stdc++.h>
using namespace std;
 
// Return the index of integer which are not less than x
// (or greater than or equal to x)
int lower_bound(int arr[], int start, int end, int x)
{
    while (start < end)
    {
        int mid = (start + end)>>1;
        if (arr[mid] >= x)
            end = mid;
        else
            start = mid + 1;
    }
 
    return start;
}
 
// Return the index of integer which are greater than x.
int upper_bound(int arr[], int start, int end, int x)
{
    while (start < end)
    {
        int mid = (start + end)>>1;
        if (arr[mid] <= x)
            start = mid + 1;
        else
            end = mid;
    }
 
    return start;
}
 
void query(int arr[], int n, int type, int x)
{
    // Counting number of integer which are greater than x.
    if (type)
        cout << n - upper_bound(arr, 0, n, x) << endl;
 
    // Counting number of integer which are not less than x
    // (Or greater than or equal to x)
    else
        cout << n - lower_bound(arr, 0, n, x) << endl;
}
 
// Driven Program
int main()
{
    int arr[] = { 1, 2, 3, 4 };
    int n = sizeof(arr)/sizeof(arr[0]);
 
    sort(arr, arr + n);
 
    query(arr, n, 0, 5);
    query(arr, n, 1, 3);
    query(arr, n, 0, 3);
 
    return 0;
}

// Java to find number of integer
// less or greater given
// integer queries
import java.util.Arrays;
class GFG
{
// Return the index of integer
// which are not less than x
// (or greater than or equal
// to x)
static int lower_bound(int arr[], int start,
                            int end, int x)
{
    while (start < end)
    {
        int mid = (start + end)>>1;
        if (arr[mid] >= x)
            end = mid;
        else
            start = mid + 1;
    }
 
    return start;
}
 
// Return the index of integer
// which are greater than x.
static int upper_bound(int arr[], int start, int end, int x)
{
    while (start < end)
    {
        int mid = (start + end)>>1;
        if (arr[mid] <= x)
            start = mid + 1;
        else
            end = mid;
    }
 
    return start;
}
 
static void query(int arr[], int n, int type, int x)
{
    // Counting number of integer
    // which are greater than x.
    if (type==1)
        System.out.println(n - upper_bound(arr, 0, n, x));
 
    // Counting number of integer which
    // are not less than x (Or greater
    // than or equal to x)
    else
        System.out.println(n - lower_bound(arr, 0, n, x));
}
 
// Driver code
public static void main (String[] args)
{
    int arr[] = { 1, 2, 3, 4 };
    int n = arr.length;
 
    Arrays.sort(arr);
 
    query(arr, n, 0, 5);
    query(arr, n, 1, 3);
    query(arr, n, 0, 3);
}
}
 
// This code is contributed by Anant Agarwal.

# Python3 program to find number of integer
# less or greater given integer queries
 
# Return the index of integer 
# which are not less than x
# (or greater than or equal to x)
def lower_bound(arr, start, end, x):
 
    while (start < end):
     
        mid = (start + end) >> 1
        if (arr[mid] >= x):
            end = mid
        else:
            start = mid + 1
     
    return start
 
# Return the index of integer
# which are greater than x.
def upper_bound(arr, start, end, x):
 
    while (start < end):
     
        mid = (start + end) >> 1
        if (arr[mid] <= x):
            start = mid + 1
        else:
            end = mid
     
    return start
 
def query(arr, n, type, x):
 
    # Counting number of integer
    # which are greater than x.
    if (type == 1):
        print(n - upper_bound(arr, 0, n, x))
 
    # Counting number of integer
    # which are not less than x
    # (Or greater than or equal to x)
    else:
        print(n - lower_bound(arr, 0, n, x))
 
# Driver code
arr = [ 1, 2, 3, 4 ]
n =len(arr)
 
arr.sort()
 
query(arr, n, 0, 5)
query(arr, n, 1, 3)
query(arr, n, 0, 3)
 
# This code is contributed by Anant Agarwal.

// C# to find number of integer less
// or greater given integer queries
using System;
 
class GFG {
     
// Return the index of integer which are
// not less than x (or greater than or
// equal to x)
static int lower_bound(int []arr, int start,
                             int end, int x)
{
    while (start < end)
    {
        int mid = (start + end)>>1;
        if (arr[mid] >= x)
            end = mid;
        else
            start = mid + 1;
    }
 
    return start;
}
 
// Return the index of integer
// which are greater than x.
static int upper_bound(int []arr, int start,
                             int end, int x)
{
    while (start < end)
    {
        int mid = (start + end)>>1;
        if (arr[mid] <= x)
            start = mid + 1;
        else
            end = mid;
    }
 
    return start;
}
 
static void query(int []arr, int n, int type, int x)
{
    // Counting number of integer
    // which are greater than x.
    if (type==1)
        Console.WriteLine(n - upper_bound(arr, 0, n, x));
 
    // Counting number of integer which
    // are not less than x (Or greater
    // than or equal to x)
    else
        Console.WriteLine(n - lower_bound(arr, 0, n, x));
}
 
// Driver code
public static void Main ()
{
    int []arr = {1, 2, 3, 4};
    int n = arr.Length;
 
    Array.Sort(arr);
 
    query(arr, n, 0, 5);
    query(arr, n, 1, 3);
    query(arr, n, 0, 3);
}
}
 
// This code is contributed by vt_m.

<?php
// PHP to find number of integer
// less or greater given
// integer queries
 
// Return the index of integer
// which are not less than x
// (or greater than or equal to x)
function lower_bound($arr, $start, $end, $x)
{
    while ($start < $end)
    {
    $mid = ($start + $end) >> 1;
        if ($arr[$mid] >= $x)
            $end = $mid;
        else
            $start = $mid + 1;
    }
 
    return $start;
}
 
// Return the index of integer
// which are greater than x.
function upper_bound($arr, $start, $end, $x)
{
    while ($start < $end)
    {
        $mid = ($start + $end) >> 1;
        if ($arr[$mid] <= $x)
            $start = $mid + 1;
        else
            $end = $mid;
    }
 
    return $start;
}
 
function query($arr, $n, $type, $x)
{
     
    // Counting number of integer
    // which are greater than x.
    if ($type)
        echo $n - upper_bound($arr, 0, $n, $x) ,"\n";
 
    // Counting number of integer
    // which are not less than x
    // (Or greater than or equal to x)
    else
        echo $n - lower_bound($arr, 0, $n, $x) ,"\n";
}
 
    // Driver Code
    $arr = array(1, 2, 3, 4);
    $n = count($arr);
 
    sort($arr);
 
    query($arr, $n, 0, 5);
    query($arr, $n, 1, 3);
    query($arr, $n, 0, 3);
 
// This code is contributed by anuj_67.
?>

<script>
 
// JavaScript program to find number of integer
// less or greater given
// integer queries
 
// Return the index of integer
// which are not less than x
// (or greater than or equal
// to x)
function lower_bound(arr, start,
                            end, x)
{
    while (start < end)
    {
        let mid = (start + end)>>1;
        if (arr[mid] >= x)
            end = mid;
        else
            start = mid + 1;
    }
   
    return start;
}
   
// Return the index of integer
// which are greater than x.
function upper_bound(arr, start, end, x)
{
    while (start < end)
    {
        let mid = (start + end)>>1;
        if (arr[mid] <= x)
            start = mid + 1;
        else
            end = mid;
    }
   
    return start;
}
   
function query(arr, n, type, x)
{
    // Counting number of integer
    // which are greater than x.
    if (type==1)
        document.write(n - upper_bound(arr, 0, n, x) + "<br/>");
   
    // Counting number of integer which
    // are not less than x (Or greater
    // than or equal to x)
    else
        document.write(n - lower_bound(arr, 0, n, x) + "<br/>");
}
   
 
// Driver code
    let arr = [ 1, 2, 3, 4 ];
    let n = arr.length;
   
    arr.sort();
   
    query(arr, n, 0, 5);
    query(arr, n, 1, 3);
    query(arr, n, 0, 3);
   
</script>