Part1 quiz eucha

Part1_강의자료/Part1_쪽지시험/문제별코드/ProblemA_방번호/1475.cpp

@@ -0,0 +1,24 @@
+#include <stdio.h>
+#include <algorithm>
+using namespace std;
+
+int main()
+{
+    int N;
+    int cnt[10] = {0, };
+
+    scanf("%d", &N);
+    while (N > 0)
+    {
+        cnt[N % 10]++;
+        N /= 10;
+    }
+
+    int ans = (cnt[6] + cnt[9] + 1) / 2;
+    for (int i = 0; i < 9; i++)
+        if (i != 6)
+            ans = max(ans, cnt[i]);
+
+    printf("%d\n", ans);
+    return 0;
+}

Part1_강의자료/Part1_쪽지시험/문제별코드/ProblemA_방번호/1475.py

@@ -0,0 +1,13 @@
+N = int(input())
+cnt = [0]*10
+
+while N > 0:
+    cnt[N%10] += 1
+    N //= 10
+
+ans = (cnt[6] + cnt[9] + 1) // 2
+for i in range(9):
+    if i != 6:
+        ans = max(ans, cnt[i])
+
+print(ans)

Part1_강의자료/Part1_쪽지시험/문제별코드/ProblemC_먹을것인가먹힐것인가/7795.cpp

@@ -0,0 +1,38 @@
+#include <stdio.h>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+int main()
+{
+    int T;
+
+    scanf("%d", &T);
+    while (T--)
+    {
+        int N, M;
+        scanf("%d %d", &N, &M);
+
+        vector<int> a(N);
+        for (int i = 0; i < N; i++)
+            scanf("%d", &a[i]);
+
+        vector<int> b(M);
+        for (int i = 0; i < M; i++)
+            scanf("%d", &b[i]);
+
+        sort(a.begin(), a.end());
+        sort(b.begin(), b.end());
+
+        int ans = 0;
+        int bi = 0;
+        for (int i = 0; i < N; i++)
+        {
+            while (bi < M && b[bi] < a[i])
+                bi++;
+            ans += bi;
+        }
+        printf("%d\n", ans);
+    }
+    return 0;
+}

Part1_강의자료/Part1_쪽지시험/문제별코드/ProblemC_먹을것인가먹힐것인가/7795.py

@@ -0,0 +1,18 @@
+T = int(input())
+
+for _ in range(T):
+    N, M = map(int, input().split())
+
+    a = list(map(int, input().split()))
+    b = list(map(int, input().split()))
+
+    a.sort()
+    b.sort()
+
+    ans = 0
+    bi = 0
+    for i in range(N):
+        while bi < M and b[bi] < a[i]:
+            bi += 1
+        ans += bi
+    print(ans)

Part1_강의자료/Part1_쪽지시험/문제별코드/ProblemE_동방보수/15317.cpp

@@ -0,0 +1,46 @@
+#include <stdio.h>
+#include <vector>
+#include <algorithm>
+using namespace std;
+typedef long long ll;
+
+ll calc_need_amount(vector<int> &cost, vector<int> &budget, int assign_cnt)
+{
+    ll need_amount = 0;
+    for (int i = 0; i < assign_cnt; i++)
+        need_amount += max(cost[i] - budget[budget.size() - assign_cnt + i], 0);
+    return need_amount;
+}
+
+int main()
+{
+    int N, M, X;
+
+    scanf("%d %d %d", &N, &M, &X);
+
+    vector<int> cost(N);
+    for (int i = 0; i < N; i++)
+        scanf("%d", &cost[i]);
+
+    vector<int> budget(M);
+    for (int i = 0; i < M; i++)
+        scanf("%d", &budget[i]);
+
+    sort(cost.begin(), cost.end());
+    sort(budget.begin(), budget.end());
+
+    int l = 0, r = min(N, M), ans = 0;
+    while (l <= r)
+    {
+        int m = (l + r) / 2;
+        if (calc_need_amount(cost, budget, m) <= X)
+        {
+            ans = m;
+            l = m + 1;
+        }
+        else
+            r = m - 1;
+    }
+    printf("%d\n", ans);
+    return 0;
+}

Part1_강의자료/Part1_쪽지시험/문제별코드/ProblemE_동방보수/15317.py

@@ -0,0 +1,24 @@
+def calc_need_amount(cost, budget, assign_cnt):
+    need_amount = 0
+    for i in range(assign_cnt):
+        need_amount += max(cost[i] - budget[len(budget)-assign_cnt+i], 0)
+    return need_amount
+
+N, M, X = map(int, input().split())
+
+cost = list(map(int, input().split()))
+budget = list(map(int, input().split()))
+
+cost.sort()
+budget.sort()
+
+l, r, ans = 0, min(N, M), 0
+while l <= r:
+    m = (l + r) // 2
+    if calc_need_amount(cost, budget, m) <= X:
+        ans = m
+        l = m + 1
+    else:
+        r = m - 1
+
+print(ans)