(2470) 두 용액

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

단계별로 풀어보기

30단계(투 포인터) 2번째

 

 

 

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

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  
  int n, a1= 0, a2= 2000000001;
  
  cin >> n;
  
  vector<int> v(n);
  
  for(int i=0;i<n;i++)  cin >> v[i];
  
  sort(v.begin(), v.end());
  
  int s= 0, e= n-1;
  
  while(s<e){
    if(abs(a1+a2)>abs(v[s]+v[e])){
      a1= v[s];
      a2= v[e];
    }
    
    if(v[s]+v[e]<0)  s++;
    else  e--;
  }
  
  cout << a1 << " " << a2;
  
  return 0;
}