Envío 6525

Código

#include <bits/stdc++.h>
using namespace std;

void printArray(int arr[], int size) {
	for (int i = 0; i < size; i++)
		cout<<arr[i]<<endl;
}

int searchNextBiggest(int arr[], int arrSize, int x) {
  int low = 0; int high = arrSize - 1;
  while(low <= high) {
    int midPoint = (high + low) / 2;
    if(arr[midPoint] > x) {
      return midPoint;
    } else {
      low = midPoint + 1;
    }
  }
  return arrSize;
}

int main() {
	int n; cin>>n;
  int arr[n];
  for(int i = 0; i < n; i++) {
    cin>>arr[i];
  }
  int c; cin>>c;
  int res[c];
  for(int j = 0; j < c; j++) {
    int x; cin>>x;
    int y = n;
    int low = 0; int high = n - 1;
    while(low <= high) {
      int midPoint = (high + low) / 2;
      if(arr[midPoint] > x) {
        y = midPoint;
        high = midPoint - 1;
      } else {
        low = midPoint + 1;
      }
    }
    res[j] = y;
  }
  printArray(res, c);
	return 0;
}