Merge pull request #48 from AlgoLeadMe/14-kangrae-jo

14-kangrae-jo

kangrae-jo/README.md

@@ -15,5 +15,6 @@
 | 11차시 | 2024.12.21 |  Greedy  | [ATM](https://www.acmicpc.net/problem/11399)|[#41](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/41)|
 | 12차시 | 2024.12.24 |  HEAP  | [크리스마스 선물](https://www.acmicpc.net/problem/14235)|[#44](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/44)|
 | 13차시 | 2024.12.28 |  Graph  | [줄 세우기](https://www.acmicpc.net/problem/2252)|[#46](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/46)|
+| 14차시 | 2024.12.31 |  Two Pointer  | [두 용액](https://www.acmicpc.net/problem/2470)|[#48](https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/48)|
 
 ---

kangrae-jo/Two Pointer/14-kangrae-jo.cpp

@@ -0,0 +1,40 @@
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main() {
+    int N;
+    cin >> N;
+
+    vector<long int> have(N);
+    for (int i = 0; i < N; i++) {
+        cin >> have[i];
+    }
+    sort(have.begin(), have.end());
+
+    int left = 0, right = N - 1;
+    long int mix = have[left] + have[right];
+
+    int pLeft = left, pRight = right;
+    long int pMix = mix;
+
+    while (left < right) {
+        long int mix = have[left] + have[right];
+        if (mix == 0) {
+            cout << have[left] << " " << have[right];
+            return 0;
+        }
+        else if (abs(mix) < abs(pMix)) {
+            pMix = mix;
+            pLeft = left;
+            pRight = right;
+        }
+        if (mix > 0) right--;
+        else left++;
+    }
+    cout << have[pLeft] << " " << have[pRight];
+
+    return 0;
+}