[Week03] BOJ_14925: 목장건설하기

weekly/week04/BOJ_14925_목장건설하기/Gyuhyeok99.cpp

@@ -0,0 +1,37 @@
+#include <iostream>
+
+using namespace std;
+
+int n, m, ret;
+int arr[1001][1001], dp[1001][1001];
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(NULL); cout.tie(NULL);
+
+    cin >> m >> n;
+
+    for (int i = 1; i <= m; i++) {
+        for (int j= 1; j <= n; j++) {
+            cin >> arr[i][j];
+        }
+    }
+
+    for (int i = 1; i <= m; i++) {
+        for (int j = 1; j <= n; j++) {
+            if (!arr[i][j]) {
+                if (!dp[i - 1][j - 1] || !dp[i][j - 1] || !dp[i - 1][j]) {
+                    dp[i][j] = 1;
+                }
+                else {
+                    dp[i][j] = min(min(dp[i - 1][j - 1], dp[i][j - 1]), dp[i - 1][j]) + 1;
+                }
+                ret = max(ret, dp[i][j]);
+            }
+        }
+    }
+
+    cout << ret << '\n';
+
+    return 0;
+}

weekly/week05/BOJ_14002_가장긴증가하는부분수열4/Gyuhyeok99.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int t, n, ret;
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(NULL); cout.tie(NULL);
+
+    cin >> t;
+    while (t--) {
+        cin >> n;
+        vector<pair<int, int>> scores;
+        ret = 1;
+        for (int i = 0; i < n; i++) {
+            int a, b;
+            cin >> a >> b;
+            scores.push_back({a, b});
+        }
+        sort(scores.begin(), scores.end());
+
+        int _max = scores[0].second;
+        for (int i = 1; i < n; i++) {
+            if (scores[i].second <= _max) {
+                _max = scores[i].second;
+                ret++;
+            }
+        }
+        cout << ret << '\n';
+    }
+    return 0;
+}

weekly/week05/BOJ_1781_컵라면/Gyuhyeok99.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <queue>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+priority_queue<int, vector<int>, greater<int>> pq;
+vector<pair<int, int>> v;
+int n, p, d, ret;
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL); cout.tie(NULL);
+
+    cin >> n;
+    for (int i = 0; i < n; i++) {
+        cin >> d >> p;
+        v.push_back({d, p});
+    }
+    sort(v.begin(), v.end());
+    for (int i = 0; i < n; i++) {
+        pq.push(v[i].second);
+        if (v[i].first < pq.size()) {
+            pq.pop();
+        }
+    }
+
+    while (pq.size()) {
+        ret += pq.top();
+        pq.pop();
+    }
+
+    cout << ret << '\n';
+
+    return 0;
+}

weekly/week05/BOJ_6236_용돈관리/Gyuhyeok99.cpp

@@ -0,0 +1,45 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int n, m, l, r, ret = 987654321;
+int arr[100001];
+
+bool check(int mid) {
+    int cnt = 1;
+    int sum = 0;
+    for(int i = 0; i < n; i++) {
+        if(sum + arr[i] > mid) {
+            cnt++;
+            sum = 0;
+        }
+        sum += arr[i];
+    }
+    return cnt <= m;
+}
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> n >> m;
+    for(int i = 0; i < n; i++) {
+        cin >> arr[i];
+        r += arr[i];
+        l = max(l, arr[i]);
+    }
+
+    while(l <= r) {
+        int mid = (l + r) / 2;
+        if(check(mid)) {
+            ret = mid;
+            r = mid - 1;
+        }
+        else {
+            l = mid + 1;
+        }
+    }
+    cout << ret << '\n';
+    return 0;
+}