模拟——Second Order Statistics

Second Order Statistics

题面翻译

题面描述

给定一个数组，输出其中第二小的整数（相等的整数只计算一次）。

输入格式

第一行，一个整数 $n$（$1\le n\le 100$），表示数组长度。

第二行，$n$ 个绝对值小于 $100$ 的整数。

输出格式

一行。如果该数组存在第二小整数，则输出第二小整数。如果不存在，则输出NO。

题目描述

Once Bob needed to find the second order statistics of a sequence of integer numbers. Lets choose each number from the sequence exactly once and sort them. The value on the second position is the second order statistics of the given sequence. In other words it is the smallest element strictly greater than the minimum. Help Bob solve this problem.

输入格式

The first input line contains integer $ n $ ( $ 1<=n<=100 $ ) — amount of numbers in the sequence. The second line contains $ n $ space-separated integer numbers — elements of the sequence. These numbers don’t exceed 100 in absolute value.

输出格式

If the given sequence has the second order statistics, output this order statistics, otherwise output NO.

样例 #1

样例输入 #1

4
1 2 2 -4

样例输出 #1

1

样例 #2

样例输入 #2

5
1 2 3 1 1

样例输出 #2

2

代码

#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;

const int N = 110;

int n;
vector<int>w;

int main(){
    cin>>n;
    
    for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        w.push_back(x);
    }
    
    sort(w.begin(),w.end());
    
    w.erase(unique(w.begin(),w.end()),w.end());
    
    
    if(w.size()<2){
        puts("NO");
    }else
    cout<<w[1];
    
    return 0;
}