basic-algo-lecture/0x13/solutions/2467_1.cpp at master · std-freejia/basic-algo-lecture · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
// Authored by : qhsl1213
// Co-authored by : BaaaaaaaaaaarkingDog
// http://boj.kr/1bc740daba1f42199b2b8c79e5a5797f
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll a[100005];

int ans1 = 1e9+5;
int ans2 = 1e9+5;

int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int N;
  cin >> N;
  for(int i=0; i<N; i++)
    cin >> a[i];
  int st = 0;
  int en = N-1;
  while(st < en){
    if(abs(ans1+ans2) > abs(a[st]+a[en])){
      ans1 = a[st];
      ans2 = a[en];
    }
    if(abs(a[st] + a[en-1]) <= abs(a[st+1] + a[en])) en = en - 1;
    else st = st + 1;
  }
  cout << ans1 << " " << ans2;
}

/*
투 포인터를 이용한 풀이
*/