#include #include #include #include using namespace std; int BinarySearch(vector data, int find, int start, int end) { int current = (start + end) / 2; if (abs(start - end) < 2) { if (abs(data[start] - find) < abs(data[end] - find)) { return start; } else return end; } if (data[current] == find) return current; else if (data[current] > find) { return BinarySearch(data, find, start, current - 1); } else { return BinarySearch(data, find, current + 1, end); } } void QuickSort(vector& data, int start, int end) { if (start >= end) return; int pivot = start; int left = start + 1; int right = end; while (left <= right) { while (data[pivot] >= data[left] && left < end) left++; while (data[pivot] < data[right] && right > start) right--; if (left >= right) { int temp = data[pivot]; data[pivot] = data[right]; data[right] = temp; } else { int temp = data[left]; data[left] = data[right]; data[right] = temp; } } QuickSort(data, start, right - 1); QuickSort(data, right + 1, end); } int main() { int num; cin >> num; vector a; for (int i = 0; i < num; i++) { int temp; cin >> temp; a.push_back(temp); } QuickSort(a, 0, a.size() - 1); int turn = -1; for (int i = 0; i < a.size(); i++) { if (a[i] * -1 < 0) { turn = i; break; } } int min = 2000000000; int x = 0; int y = 0; for (int i = 0; i < turn; i++) { int temp = BinarySearch(a, a[i] * -1, turn, a.size() - 1); if (min > abs(a[i] + a[temp])) { min = abs(a[i] + a[temp]); x = a[i]; y = a[temp]; } } if (turn == -1) { x = a[a.size() - 2]; y = a[a.size() - 1]; cout << x << " " << y << endl; return 0; } else if (turn == 0) { x = a[0]; y = a[1]; cout << x << " " << y << endl; return 0; } if (a[turn] == 0) { if (a.size() > turn + 1) { if (min > abs(a[turn] + a[turn + 1])) { min = abs(a[turn] + a[turn + 1]); x = a[turn]; y = a[turn + 1]; } } else { if (0 <= turn - 1) { if (min > abs(a[turn] + a[turn - 1])) { min = abs(a[turn] + a[turn - 1]); x = a[turn - 1]; y = a[turn]; } } } } else { if (a.size() > turn + 1) { if (min > abs(a[turn] + a[turn + 1])) { min = abs(a[turn] + a[turn + 1]); x = a[turn]; y = a[turn + 1]; } } if (0 <= turn - 2) { if (min > abs(a[turn - 2] + a[turn - 1])) { min = abs(a[turn - 2] + a[turn - 1]); x = a[turn - 2]; y = a[turn - 1]; } } } cout << x << " " << y << endl; }

제출 #80475

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

체커 출력:

입력:

오답 출력:

정답 출력:

체커 출력: