Submission #1993391

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b)  for(int (i)=(a);(i)<(b);(i)++)
#define REP(i,n)    FOR(i,0,n)
#define RER(i,n)    FOR(i,0,(n+1))
#define pb          push_back
#define mp(a,b)     make_pair((a),(b))
#define mset(m,v)   memset(m,v,sizeof(m))
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pair<int, int> > vpii;
typedef long long ll;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
typedef vector<pair<ll, ll> > vpll;
typedef vector<string> vs;
typedef long double ld;
const double EPS    = 1e-10;
const int INF       = 1e+9;
const double PI     = acos(-1);


auto main() -> int
{
    int n;
    cin >> n;

    vi ls;
    REP(i, n) {
        int p;
        cin >> p;
        if ( find(begin(ls), end(ls), p) == end(ls) ) {
            ls.push_back(p);
        }
    }

    sort(begin(ls), end(ls));
    reverse(begin(ls), end(ls));
    cout << ls[1] << endl;

    return 0;
}

Submission Info

Judge Result