Submission #174390

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>

using namespace std;

int main(int argc, const char * argv[])
{
    int N;
    cin >> N;
    
    vector<int> vec;
    set<int> s;
    
    for (int i = 0; i < N; i++) {
        int x;
        cin >> x;
        if (s.find(x) == s.end()) {
            vec.push_back(x);
            s.insert(x);
        }
    }
    
    sort(vec.begin(), vec.end());
    
    cout << vec[vec.size()-2] << endl;
    
    return 0;
}

Submission Info

Judge Result