16-InSange

InSange/README.md

@@ -17,5 +17,6 @@
 | 13차시 | 2024.05.22 |  BFS  | [특정 거리의 도시 찾기](https://www.acmicpc.net/problem/18352)  | [#13](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/53)]
 | 14차시 | 2024.05.27 |  투 포인터  | [포도주 시음](https://www.acmicpc.net/problem/31589)  | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/56)]
 | 15차시 | 2024.05.27 |  정렬  | [통나무 건너뛰기](https://www.acmicpc.net/problem/11497)  | [#15](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/57)]
+| 16차시 | 2024.06.28 |  그래프  | [Maximum_Total_Importance_ofRoads](https://leetcode.com/problems/maximum-total-importance-of-roads/)  | [#16](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/63)]
 =======
 ---

InSange/그래프/2285_Maximum_Total_Importance_of_Roads.cpp

@@ -0,0 +1,40 @@
+#include <vector>
+#include <queue>
+
+using namespace std;
+
+class Solution {
+public:
+    long long maximumImportance(int n, vector<vector<int>>& roads) {
+        vector<vector<int>> conn;   // road
+        priority_queue<pair<long long, int>> pq;  // connect degree first: degree, second: index
+        long long answer = 0;
+
+        conn.assign(n, vector<int>());
+
+        for (auto road : roads)
+        {
+            int v1 = road[0];
+            int v2 = road[1];
+
+            conn[v1].push_back(v2);
+            conn[v2].push_back(v1);
+        }
+
+        for (int i = 0; i < n; i++)
+        {
+            pq.push({ conn[i].size(), i });
+        }
+
+        while (!pq.empty())
+        {
+            pair<long long, int> cur;
+            cur = pq.top();
+            pq.pop();
+
+            answer += (n-- * cur.first);
+        }
+
+        return answer;
+    }
+};

dhlee777/dp/구간합구하기5.cpp

@@ -0,0 +1,23 @@
+#include<iostream>
+using namespace std;
+int dp[1025][1025];
+int main(void) {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	int size, cnt, start_row, start_col, end_row, end_col,temp;
+	cin >> size >> cnt;
+
+	for (int i = 1; i <=size; i++) {
+		for (int j = 1; j <=size; j++) {
+			cin >> temp;
+			dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + temp;
+		}
+	}
+	for (int k = 0; k < cnt; k++) {
+		cin >> start_row >> start_col >> end_row >> end_col;
+		cout << dp[end_row][end_col] - dp[start_row - 1][end_col] - dp[end_row][start_col - 1] + dp[start_row - 1][start_col - 1];
+		cout << "\n";
+	}
+
+	return 0;
+}