[백준] 2473번: 세 용액

문제

https://www.acmicpc.net/problem/2473

2473번: 세 용액

문제해결

이분탐색

 

결과

코드

#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;

using ll = long long;
const int LM = 5005;
ll arr[LM], ans[3];


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n = 0;
	cin >> n;

	for (int i = 0; i < n; i++)
	{
		cin >> arr[i];
	}

	sort(arr, arr + n);

	ll result = 3000000001;
	for (int k = 0; k < n-2; k++)
	{
		int low = k+1, high = n - 1;

		while (low < high)
		{
			ll val = arr[k]+arr[low]+arr[high];

			if (abs(val) < result)
			{
				result = abs(val);
				ans[0] = arr[k];
				ans[1] = arr[low];
				ans[2] = arr[high];
			}

			if (val < 0)
				low++;
			else
				high--;
		}
	}
	cout << ans[0] << " " << ans[1] << " " << ans[2];
	return 0;
}