diff --git "a/PROGRAMMERS/[12938] \354\265\234\352\263\240\354\235\230 \354\247\221\355\225\251/wldy4627/Main.java" "b/PROGRAMMERS/[12938] \354\265\234\352\263\240\354\235\230 \354\247\221\355\225\251/wldy4627/Main.java"
new file mode 100644
index 0000000..da84c08
--- /dev/null
+++ "b/PROGRAMMERS/[12938] \354\265\234\352\263\240\354\235\230 \354\247\221\355\225\251/wldy4627/Main.java"	
@@ -0,0 +1,29 @@
+package prog.p12938.wldy4627;
+
+public class Main {
+	class Solution {
+		public int[] solution(int n, int s) {
+			int[] answer = {};
+
+			if (s < n) {
+				return new int[]{-1};
+			}
+
+			answer = new int[n];
+
+			int num = s / n;
+			for (int i = 0; i < n; i++) {
+				answer[i] = num;
+			}
+
+			int remainder = s % n;
+			if (remainder > 0) {
+				for (int i = 1; i <= remainder; i++) {
+					answer[n - i]++;
+				}
+			}
+
+			return answer;
+		}
+	}
+}
diff --git "a/PROGRAMMERS/[12987] \354\210\253\354\236\220 \352\262\214\354\236\204/wldy4627/Main.java" "b/PROGRAMMERS/[12987] \354\210\253\354\236\220 \352\262\214\354\236\204/wldy4627/Main.java"
new file mode 100644
index 0000000..9744872
--- /dev/null
+++ "b/PROGRAMMERS/[12987] \354\210\253\354\236\220 \352\262\214\354\236\204/wldy4627/Main.java"	
@@ -0,0 +1,23 @@
+package proj.p12987.wldy4627;
+
+import java.util.Arrays;
+
+public class Main {
+	class Solution {
+		public int solution(int[] A, int[] B) {
+			int answer = 0;
+
+			Arrays.sort(A);
+			Arrays.sort(B);
+
+			int aIndex = 0;
+			for (int i = 0; i < B.length; i++) {
+				if (A[aIndex] < B[i]) {
+					answer++;
+					aIndex++;
+				}
+			}
+			return answer;
+		}
+	}
+}
diff --git "a/PROGRAMMERS/[42884] \353\213\250\354\206\215\354\271\264\353\251\224\353\235\274/wldy4627/Main.java" "b/PROGRAMMERS/[42884] \353\213\250\354\206\215\354\271\264\353\251\224\353\235\274/wldy4627/Main.java"
new file mode 100644
index 0000000..6f0747a
--- /dev/null
+++ "b/PROGRAMMERS/[42884] \353\213\250\354\206\215\354\271\264\353\251\224\353\235\274/wldy4627/Main.java"	
@@ -0,0 +1,24 @@
+package prog.p42884.wldy4627;
+
+import java.util.Arrays;
+
+public class Main {
+	class Solution {
+		public int solution(int[][] routes) {
+			int answer = 0;
+
+			Arrays.sort(routes, (o1, o2) -> Integer.compare(o1[1], o2[1]));
+			int camera = routes[0][1];
+			answer++;
+
+			for (int i = 1; i < routes.length; i++) {
+				if (camera < routes[i][0] || camera > routes[i][1]) {
+					answer++;
+					camera = routes[i][1];
+				}
+			}
+
+			return answer;
+		}
+	}
+}