Problem:
Score : 300 points

Problem Statement

Given is a sequence of integers A_1, A_2, ..., A_N.
If its elements are pairwise distinct, print YES; otherwise, print NO.

Constraints

2 ≤ N ≤ 200000

1 ≤ A_i ≤ 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 ... A_N

Output

If the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.

Sample Input 1

5
2 6 1 4 5

Sample Output 1

YES

The elements are pairwise distinct.

Sample Input 2

6
4 1 3 1 6 2

Sample Output 2

NO

The second and fourth elements are identical.

Sample Input 3

2
10000000 10000000

Sample Output 3

NO

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int main(){
    int n;
    vector<int> values;
    bool repetido = false;
    cin>>n;
    if(2<=n<=200000){
        for(int i =0;i<n;i++){
            int numero;
            cin>>numero;
            values.push_back(numero);
        }
        sort(values.begin(),values.end());
        if(n>2){
           for (int k = 0; k < values.size()-1; k++)
           {
                if(values[k]==values[k+1])
                    repetido = true;
           }
           
            if(repetido)
                cout<<"NO";
             else
                cout<<"YES";
        }else{
            cout<<"NO";
        }
       
        
        
    }else
        return 0;
}