[Algorithm] SWEA 6485 삼성시의 버스 노선

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWczm7QaACgDFAWn 

SW Expert Academy

 

---

 

import java.util.*;
import java.io.*;

public class Solution {
	public static void main (String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int T = Integer.parseInt(br.readLine());
		
		for (int t = 1; t <= T; t++) {
			int N = Integer.parseInt(br.readLine()); // 노선 개수
			int[][] line = new int[N+1][2];
			for (int n = 1; n < N+1; n++) {
				StringTokenizer st = new StringTokenizer(br.readLine());
				line[n][0] = Integer.parseInt(st.nextToken());
				line[n][1] = Integer.parseInt(st.nextToken());
			}
			
			int P = Integer.parseInt(br.readLine()); // 버스 정류장 개수
			
			int[] result = new int[P];
			for (int p = 0; p < P; p++) {
				int busStop = Integer.parseInt(br.readLine());
				int count = 0;
				for (int n = 1; n < N+1; n++) 
					if(busStop >= line[n][0] && busStop <= line[n][1])	count++;
				
				result[p] = count;
			}
			
			System.out.print("#" + t + " ");
			for (int i = 0; i < P; i++)	System.out.print(result[i] + " ");
			System.out.println();
		}
	}
}