Codeforces Beta Round #22 (Div. 2 Only) A. Second Order Statistics

最新推荐文章于 2022-09-26 15:29:13 发布

AlberTeslaWizard

最新推荐文章于 2022-09-26 15:29:13 发布

阅读量379

点赞数 1

本文链接：https://blog.csdn.net/AlberTesla/article/details/109402453

版权

A. Second Order Statistics
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.

Input
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.

Output
If the given sequence has the second order statistics, output this order statistics, otherwise output NO.
Examples
input
4
1 2 2 -4
output
1
input
5
1 2 3 1 1
output
2
My Answer Code:

/*
	Author:Albert Tesla Wizard
	TimeL2020/10/31 14:48
*/
#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    vector<int>a(n);
    for(int i=0;i<n;i++)cin>>a[i];
    sort(a.begin(),a.end());
    int Min=a[0],flag=0,value;
    for(int i=1;i<n;i++)
    {
        if(a[i]>Min){flag=1;value=a[i];break;}
    }
    if(flag)cout<<value<<'\n';
    else cout<<"NO"<<'\n';
    return 0;
}