Submission #1432722

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <numeric>
#include <fstream>
#include <queue>
#include <cstdio>
#include <deque>
#define fol(i,n) for(int i=0;i<n;i++)
#define db(a) cout << a<< endl;
using namespace std;

int main(){
    int n,b,ans;
    priority_queue<int>a;
    cin >>n;
    fol(i,n) {cin>>b;a.push(b);}
    int top = a.top();
    a.pop();
    while (1){
        if (top!=a.top()){ans = a.top();break;}
        a.pop();
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result