[SW Expert Academy] 삼성시의 버스 노선 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWczm7QaACgDFAWn&categoryId=AWczm7QaACgDFAWn&categoryType=CODE&problemTitle=%EC%82%BC%EC%84%B1%EC%8B%9C%EC%9D%98&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1

SW Expert Academy

 

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			int n = sc.nextInt();

			int count[] = new int[5001];

			for (int i = 0; i < n; i++) {

				int a = sc.nextInt();
				int b = sc.nextInt();

				for (int j = a; j <= b; j++) {
					count[j]++;
				}

			}

			int p = sc.nextInt();

			StringBuilder sb = new StringBuilder();

			System.out.print("#" + tc + " ");
			for (int i = 0; i < p; i++) {
				int num = sc.nextInt();
				sb.append(count[num]+" ");
			}
			System.out.println(sb);
		}

	}
}