from collections import Counter
n = int(input())
a = []
for _ in range(n) : a.append(int(input()))
s = set(a)
if len(s) != 2 : print("NO")
else :
cnt = Counter(a)
l = []
for i in s : l.append(cnt[i])
if l[0] == l[1] :
print("YES")
for i in s : print(i, end = ' ')
else : print("NO")#include<bits/stdc++.h>
using namespace std;
main()
{
int n;
cin>>n;
int V[101]={0};
for(int i=0;i<n;i++)
{
int x;
cin>>x;
V[x]++;
}
bool flag=0;
for(int i=1;i<=100;i++)
{
for(int j=i+1;j<=100;j++)
{
if(V[i]==V[j] && V[i]>0 && V[j]>0 && (V[i]+V[j]==n))
{
flag=1;
cout<<"YES\n"<<i<<" "<<j<<"\n";
break;
}
}
}
if(flag==0)
{
cout<<"NO\n";
}
}
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |
416. Partition Equal Subset Sum | 1446. Consecutive Characters |
1618A - Polycarp and Sums of Subsequences | 1618B - Missing Bigram |
938. Range Sum of BST | 147. Insertion Sort List |
310. Minimum Height Trees | 2110. Number of Smooth Descent Periods of a Stock |
2109. Adding Spaces to a String | 2108. Find First Palindromic String in the Array |
394. Decode String | 902. Numbers At Most N Given Digit Set |