백준 2467번 용액 C++

출처 : https://www.acmicpc.net/problem/2467

 

투 포인터를 이용해서 풀었다.

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int n;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    int left = 0;
    int right = n - 1;
    int ans1 = v[left];
    int ans2 = v[right];
    int sum = abs(v[left] + v[right]);
    while (left < right) {
        int currSum = v[left] + v[right];
        if (abs(currSum) < sum) {
            ans1 = v[left];
            ans2 = v[right];
            sum = abs(currSum);
        }
        if (currSum == 0)
            break;
        if (currSum < 0)
            left++;
        else
            right--;
    }
    cout << ans1 << " " << ans2;
}