목록백준 Closest Pair (1)
어흥
[백준 14746] Closest Pair (C++)
문제 링크: www.acmicpc.net/problem/14746 14746번: Closest Pair Your program is to read from standard input. The input consists of four lines. The first line contains two integers, n (1 ≤ n ≤ 500,000) and m (1 ≤ m ≤ 500,000), where n is the number of points in set P and m is the number of points in set Q. In th www.acmicpc.net 1. 주의할 점 - 두 포인터를 사용하여 해결한다 2. 구현 - 각 원소를 P,Q 벡터에 담는다 - P,Q 벡터를 오름차순으로 정렬한다..
알고리즘/백준
2021. 4. 28. 16:46