Submission #3854681

---

Source Code Expand

#include<iostream>
#include<algorithm>

int a[10001];
bool mmp(int x,int y){return x>y;}
int main(){
    int n;
    std::cin>>n;
    for(register int i=1;i<=n;++i)
        std::cin>>a[i];
    int k=std::unique(a+1,a+1+n)-a-1;
    std::sort(a+1,a+1+k,mmp);
    std::cout<<a[2];
}

Submission Info

Judge Result