Submission #2670152

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <queue>
#include <stack>
#include <functional>
#define rep(i,n) for(int i=0;i<n;i++)
using ll = long long;
using namespace std;
int main() {
	ll n, m, A[10101];
	cin >> n;
	rep(i, n) cin >> A[i];
	sort(A, A + n);
	m = A[n - 1];
	for (int i = n - 2; i >= 0; i--) {
		if (A[i] != m) {
			cout << A[i] << endl;
			break;
		}
	}
	return 0;
}

Submission Info

Judge Result