Submission #1451489

---

Source Code Expand

#include <iostream>
#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>

using namespace std;
using llng = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
template<class T> using hset = unordered_set<T>;
template<class Key, class T> using hmap = unordered_map<Key, T>;

int main() {
    int N; cin >> N;
    int max = 0, nmax = 0;
    for (int i=0; i<N; i++) {
        int A; cin >> A;
        if (A > max) {
            nmax = max;
            max = A;
            continue;
        }
        if (A == max) {
            continue;
        }
        if (A > nmax) {
            nmax = A;
            continue;
        }
    }
    cout << nmax << endl;
    return 0;
}

Submission Info

Judge Result