Merge pull request #1078 from AlgorithmWithGod/zinnnn37

[20251009] BOJ / G2 / 문제집 / 김민진

Author: ShinHeeEul

zinnnn37/202510/9 BOJ G2 문제집.md

@@ -0,0 +1,74 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class BJ_1766_문제집 {
+
+	private static final BufferedReader  br = new BufferedReader(new InputStreamReader(System.in));
+	private static final BufferedWriter  bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	private static final StringBuilder   sb = new StringBuilder();
+	private static       StringTokenizer st;
+
+	private static int N, M;
+	private static int[] inDegree;
+
+	private static Queue<Integer>  q;
+	private static List<Integer>[] graph;
+
+	public static void main(String[] args) throws IOException {
+		init();
+		sol();
+	}
+
+	private static void init() throws IOException {
+		st = new StringTokenizer(br.readLine());
+		N  = Integer.parseInt(st.nextToken());
+		M  = Integer.parseInt(st.nextToken());
+
+		graph = new ArrayList[N + 1];
+		for (int i = 1; i <= N; i++) {
+			graph[i] = new ArrayList<>();
+		}
+
+		inDegree = new int[N + 1];
+		for (int i = 0; i < M; i++) {
+			st = new StringTokenizer(br.readLine());
+
+			int u = Integer.parseInt(st.nextToken());
+			int v = Integer.parseInt(st.nextToken());
+
+			graph[u].add(v);
+			inDegree[v]++;
+		}
+
+		q = new PriorityQueue<>();
+	}
+
+	private static void sol() throws IOException {
+		for (int i = 1; i <= N; i++) {
+			if (inDegree[i] == 0) {
+				q.offer(i);
+			}
+		}
+
+		while (!q.isEmpty()) {
+			int cur = q.poll();
+
+			sb.append(cur).append(" ");
+
+			for (int v : graph[cur]) {
+				inDegree[v]--;
+				if (inDegree[v] == 0) {
+					q.offer(v);
+				}
+			}
+		}
+
+		bw.write(sb.toString());
+		bw.flush();
+		bw.close();
+		br.close();
+	}
+
+}
+```