10-InSange

InSange/README.md

@@ -9,5 +9,8 @@
 | 5차시 | 2024.03.27 |  DP  | [RGB거리2](https://www.acmicpc.net/problem/17404)  | [#5](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/19)]
 | 6차시 | 2024.04.01 |  최소신장트리  | [행성 터널](https://www.acmicpc.net/problem/2887)  | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/24)]
 | 7차시 | 2024.04.04 |  스택  | [문자열 폭발](https://www.acmicpc.net/problem/9935)  | [#7](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/28)]
+| 8차시 | 2024.04.09 |  투 포인터  | [두 용액](https://www.acmicpc.net/problem/2470)  | [#8](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/32)]
+| 9차시 | 2024.04.12 |  힙  | [Top K Frequent Words](https://leetcode.com/submissions/detail/1180988760/)  | [#9](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/28)]
+| 10차시 | 2024.05.02 |  스택  | [오아시스 재결합](https://www.acmicpc.net/problem/3015)  | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-8/pull/40)]
 =======
 ---

InSange/스택/3015.cpp

@@ -0,0 +1,62 @@
+#include <iostream>
+#include <vector>
+#include <stack>
+
+using namespace std;
+
+long long N, n, a, b, answer;
+vector<int> line;
+stack<pair<int, int>> st;
+
+// a1 ���� b�� ũ�� ����
+// a1 ���� b�� �۴ٸ� ���� b�� 
+void Solve()
+{
+	cin >> N;
+
+	for (int i = 0; i < N; i++)
+	{
+		cin >> n;
+		line.push_back(n);
+	}
+
+	for (auto num : line)
+	{
+		int cnt = 1;
+
+		while (!st.empty())
+		{
+			int cur = st.top().first;
+			int cur_cnt = st.top().second;
+			if (cur < num)
+			{
+				answer+= cur_cnt;
+			}
+			else if (cur == num)
+			{
+				answer += cur_cnt;
+				cnt += cur_cnt;
+			}
+			else //if(st.top().first > num)
+			{
+				answer++;
+				break;
+			}
+			st.pop();
+		}
+		//cout << num << ", " << answer << "\n";
+		st.push({num, cnt});
+	}
+
+	cout << answer;
+}
+
+int main()
+{
+	cin.tie(nullptr);
+	ios::sync_with_stdio(false);
+
+	Solve();
+
+	return 0;
+}

InSange/투포인터/2470.cpp

@@ -0,0 +1,96 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+const int MAX_VAL = 1999999999;
+
+int N, num, minVal, aanswer, banswer;
+vector<int> acid;	// �꼺
+vector<int> basic;	// ���⼺
+
+bool cmp(int a, int b)
+{
+	return a > b;
+}
+
+void Input()
+{
+	cin >> N;
+
+	for (int i = 0; i < N; i++)
+	{
+		cin >> num;
+		(num > 0) ? acid.push_back(num) : basic.push_back(num);
+	}
+
+	sort(acid.begin(), acid.end());
+	sort(basic.begin(), basic.end(), cmp);
+
+	minVal = MAX_VAL;
+}
+
+void Solve()
+{
+	int a_index = 0;
+	int b_index = 0;
+	while (a_index < acid.size() && b_index < basic.size())
+	{
+		int anum, bnum;
+		anum = acid[a_index];
+		bnum = basic[b_index];
+
+		if (abs(anum + bnum) < minVal)
+		{
+			aanswer = anum;
+			banswer = bnum;
+			minVal = abs(anum + bnum);
+		}
+
+		(abs(anum) > abs(bnum)) ? b_index++ : a_index++;
+	}
+
+	int sum;
+	if (acid.size() > 1)
+	{
+		sum = abs(acid[0] + acid[1]);
+		if (sum < minVal)
+		{
+			aanswer = acid[1];
+			banswer = acid[0];
+		}
+	}
+	if (basic.size() > 1)
+	{
+		sum = abs(basic[0] + basic[1]);
+		if (sum < minVal)
+		{
+			aanswer = basic[0];
+			banswer = basic[1];
+		}
+	}
+	if (acid.empty())
+	{
+		aanswer = basic[0];
+		banswer = basic[1];
+	}
+	if (basic.empty())
+	{
+		aanswer = acid[1];
+		banswer = acid[0];
+	}
+
+	cout << banswer << " " << aanswer;
+}
+
+int main()
+{
+	cin.tie(nullptr);
+	ios::sync_with_stdio(false);
+
+	Input();
+	Solve();
+
+	return 0;
+}

InSange/힙/Top K Frequent Words.cpp

@@ -0,0 +1,34 @@
+#include <iostream>
+#include <vector>
+#include <unordered_map>
+#include <queue>
+
+using namespace std;
+
+class Solution {
+public:
+    struct compare {
+        bool operator()(pair<int, string>& a, pair<int, string>& b)
+        {
+            if (a.first == b.first) return a.second > b.second;
+            return a.first < b.first;
+        }
+    };
+
+    vector<string> topKFrequent(vector<string>& words, int k) {
+        unordered_map<string, int> um;
+        priority_queue<pair<int, string>, vector<pair<int, string>>, compare> pq;
+        vector<string> ans;
+
+        for (auto s : words) um[s]++;
+        for (pair<string, int> v : um) pq.push({ v.second, v.first });
+
+        while (k--)
+        {
+            ans.push_back(pq.top().second);
+            pq.pop();
+        }
+
+        return ans;
+    }
+};