Add files via upload

Author: Yoo-Hyuna

2025-09-08/유현아/[BOJ]강의실 배정_11000.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+#include <algorithm>
+using namespace std;
+
+struct study {
+    int start, end;
+    bool operator<(const study& other) const {
+        return start < other.start;
+    }
+};
+
+int main() {
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int N;
+    cin >> N;
+    vector<study> lectures(N);
+    for (int i = 0; i < N; i++) {
+        cin >> lectures[i].start >> lectures[i].end;
+    }
+
+    sort(lectures.begin(), lectures.end()); // 시작 시간 기준 정렬
+
+    priority_queue<int, vector<int>, greater<int>> pq; // 끝나는 시간 최소 힙
+
+    for (auto& lec : lectures) {
+        if (!pq.empty() && pq.top() <= lec.start) {
+            pq.pop(); // 기존 강의실 재사용 가능
+        }
+        pq.push(lec.end); // 새 강의실 추가 또는 기존 강의실 갱신
+    }
+
+    cout << pq.size(); // 최소 강의실 수
+    return 0;
+}

2025-09-08/유현아/[BOJ]평범한 배낭_12865.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int main() {
+	freopen_s(new FILE*, "input.txt", "r", stdin);
+	ios::sync_with_stdio(false);
+	cin.tie(nullptr);
+
+	int N, K, a,b;
+
+	cin >> N >> K;
+	vector<vector<int>> input(N + 1, vector<int>(2, 0));
+	vector<vector<int>> V(N + 1, vector<int>(K + 1, 0));
+	input[0][0] = input[0][1] = 0;
+
+	for (int i = 1; i <= N;i++) {
+		cin >> input[i][1] >> input[i][0];  // weight:1, value:0
+	}
+	sort(input.begin(), input.end());
+
+	for (int i = 0; i <= N;i++) {
+		for (int j = 0; j <= K;j++) {
+			if (i == 0 || j == 0){
+				V[i][j] = 0;
+			}
+			else if (input[i][1] <= j) {
+				V[i][j] = max(V[i - 1][j], input[i][0] + V[i - 1][j - input[i][1]]);
+			}
+			else {
+				V[i][j] = V[i - 1][j];
+			}
+		}
+	}
+
+
+	cout << V[N][K];
+
+	return 0;
+}