diff --git a/src/week6/BOJ7795/BOJ7795_V1.cpp b/src/week6/BOJ7795/BOJ7795_V1.cpp
new file mode 100644
index 0000000..a1331e2
--- /dev/null
+++ b/src/week6/BOJ7795/BOJ7795_V1.cpp
@@ -0,0 +1,56 @@
+#include <bits/stdc++.h>
+using namespace std;
+int T;
+vector<int> ret;
+int main() {
+
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+
+    cin >> T;
+
+    for (int i=0; i<T; i++) {
+        int N,M;
+        cin >> N >> M;
+        vector<int> A,B;
+        for (int j=0; j<N; j++) {
+            int temp;
+            cin >> temp;
+            A.push_back(temp);
+        }
+        for (int j=0; j<M; j++) {
+            int temp;
+            cin >> temp;
+            B.push_back(temp);
+        }
+
+        sort(A.begin(), A.end());
+        sort(B.begin(), B.end());
+
+        int prev_high=0;
+        int cnt=0;
+        for (int j=0; j<N; j++) {
+            int curr=M;
+            for (int k=prev_high; k<M; k++) {
+                if (A[j] <= B[k]) {
+                    curr = k;
+                    prev_high = k;
+                    break;
+                }
+            }
+
+            cnt += curr;
+        }
+        ret.push_back(cnt);
+    }
+
+
+    for (int ret_num : ret) {
+        cout << ret_num << '\n';
+    }
+
+
+
+    return 0;
+}
\ No newline at end of file
diff --git a/src/week6/BOJ7795/BOJ7795_V2.cpp b/src/week6/BOJ7795/BOJ7795_V2.cpp
new file mode 100644
index 0000000..2f9a927
--- /dev/null
+++ b/src/week6/BOJ7795/BOJ7795_V2.cpp
@@ -0,0 +1,46 @@
+#include <bits/stdc++.h>
+using namespace std;
+int T;
+vector<int> ret;
+int main() {
+
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+    cout.tie(nullptr);
+
+    cin >> T;
+
+    for (int i=0; i<T; i++) {
+        int N,M;
+        cin >> N >> M;
+        vector<int> A,B;
+        for (int j=0; j<N; j++) {
+            int temp;
+            cin >> temp;
+            A.push_back(temp);
+        }
+        for (int j=0; j<M; j++) {
+            int temp;
+            cin >> temp;
+            B.push_back(temp);
+        }
+
+        sort(A.begin(), A.end());
+        sort(B.begin(), B.end());
+        int ret_num=0;
+        for (int j=0; j<N; j++) {
+            auto pos = lower_bound(B.begin(), B.end(), A[j]);
+            ret_num += (int)(pos-B.begin());
+        }
+        ret.push_back(ret_num);
+    }
+
+
+    for (int ret_num : ret) {
+        cout << ret_num << '\n';
+    }
+
+
+
+    return 0;
+}
\ No newline at end of file