diff --git a/src/dabincho/binary/10815.py b/src/dabincho/binary/10815.py
new file mode 100644
index 0000000..de194e0
--- /dev/null
+++ b/src/dabincho/binary/10815.py
@@ -0,0 +1,32 @@
+N = int(input())
+sample_num = list(map(int, input().split()))
+M = int(input())
+sample_right = list(map(int, input().split()))
+
+def binary_search(arr, n, start, end):
+    while start <= end:
+        mid = (start + end) // 2
+        
+        if arr[mid] == n:
+            return mid
+        elif arr[mid] > n:
+            end = mid - 1
+        else:
+            start = mid + 1
+    return -1
+
+def find_num(number, right):
+    number.sort()
+    end = N - 1
+
+    for i in range(M):
+        ind = binary_search(number, right[i], 0, end)
+        if ind == -1:
+            right[i] = 0
+        else:
+            right[i] = 1
+
+    for i in right:
+        print(i, end = ' ')
+
+find_num(sample_num, sample_right)
\ No newline at end of file
diff --git a/src/dabincho/binary/1822.py b/src/dabincho/binary/1822.py
new file mode 100644
index 0000000..e97c290
--- /dev/null
+++ b/src/dabincho/binary/1822.py
@@ -0,0 +1,34 @@
+ab = list(map(int, input().split()))
+A = list(map(int, input().split()))
+B = list(map(int, input().split()))
+
+def binary_search(arr, n, start, end):
+    while start <= end:
+        mid = (start + end) // 2
+        
+        if arr[mid] == n:
+            return mid
+        elif arr[mid] > n:
+            end = mid - 1
+        else:
+            start = mid + 1
+    return -1
+
+
+def minus(a, b):
+    a.sort()
+    b.sort()
+    result = []
+
+    for i in a:
+        ind = binary_search(b, i, 0, ab[1]-1)
+        if ind == -1:
+            result.append(i)
+    
+    count = len(result)
+    print(count)
+    if count != 0:
+        for n in result:
+            print(n, end=' ')
+
+minus(A, B)
\ No newline at end of file