백준 소스코드 [C++] 2473 세 용액

www.acmicpc.net/problem/2473

2473번: 세 용액

백준 소스코드 [C++] 2473 세 용액

#include <iostream>
#include <algorithm>
#include <queue>
#include <string.h>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string>
#include <set>
#define all(v) v.begin(), v.end()
#define pii pair<int,int>
#define make_unique(v) v.erase(unique(v.begin(), v.end()), v.end())
typedef long long ll;
using namespace std;


int n;
vector<ll> v;
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n; v.resize(n);
	for (int i = 0;i < n;i++) cin >> v[i];
	sort(all(v));
	int L = 0, M = 1, R = n - 1;
	ll here = abs(v[L] + v[M] + v[R]), there;
	int l = 0, m = 1, r = n - 1;
	for (L = 0;L <= n - 3;L++) {
		M = L + 1;
		R = n - 1;
		while (M < R) {
			there = v[L] + v[M] + v[R];
			if (here > abs(there)) {
				here = abs(there);
				l = L, m = M, r = R;
			}
			if (there < 0) {
				M++;
			}
			else R--;
		}
	}
	cout << v[l] << " " << v[m] << " " << v[r];
	return 0;
}