8. 이분검색

import java.util.*;

class Main {
	public int solution(int N, int M, int[] arr) {
		int answer = 0;
		Arrays.sort(arr);
		int lt = 0, rt = N - 1, mid = (lt + rt) / 2;
		while (lt <= rt) {
			mid = (lt + rt) / 2;
			if (arr[mid] == M) {
				answer = mid + 1;
				break;
			} else if (arr[mid] > M) {
				rt = mid - 1;
			} else if (arr[mid] < M) {
				lt = mid + 1;
			}
		}
		return answer;
	}

	public static void main(String[] args) {
		Main T = new Main();
		Scanner kb = new Scanner(System.in);
		int N = kb.nextInt();
		int K = kb.nextInt();
		int[] arr = new int[N];
		for (int i = 0; i < N; i++)
			arr[i] = kb.nextInt();
		System.out.print(T.solution(N, K, arr));
		kb.close();
	}
}