Created
October 24, 2019 17:33
-
-
Save itssomething/b893ad118acc5f08f08f9ad65362150f to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* To change this license header, choose License Headers in Project Properties. | |
* To change this template file, choose Tools | Templates | |
* and open the template in the editor. | |
*/ | |
package luyentap2; | |
import java.util.Arrays; | |
import java.util.Scanner; | |
/** | |
* | |
* @author Manh | |
*/ | |
public class Bai10 { | |
static long N[], Q[]; | |
static int n; | |
public static void main(String[] args) { | |
Scanner in = new Scanner(System.in); | |
n = in.nextInt(); | |
N = new long[n]; | |
for(int i=0;i<n;i++){ | |
N[i] = in.nextLong(); | |
} | |
Arrays.sort(N); | |
int q = in.nextInt(); | |
for(int i=1;i<=q;i++){ | |
long k = in.nextLong(); | |
int res = binarySearch(0, n-1, k); | |
if(res == -1) | |
System.out.println("0"); | |
else | |
System.out.println(res+1); | |
} | |
} | |
static int binarySearch(int l, int r,long K){ | |
if(l > r) return -1; | |
int mid = (l + r)/2; | |
if((N[mid] <= K && N[mid + 1] > K) || (N[mid] <= K && mid + 1 == n) ) return mid; | |
else if(N[mid] <= K) return binarySearch(mid + 1, r, K); | |
else return binarySearch(l, mid - 1, K); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment