Submission #1403446

---

Source Code Expand

#include <bits/stdc++.h>

#define rep(i, first, to) for(int i = first; i < to; ++i)
#define REP(i, first, to) for(int i = first; i <= to; ++i)
#define MyDebug

#ifdef MyDebug
	#define debug(x) cout << #x << " : " << x << endl
	#define debugP(x) cout << x << endl
#else
	#define debug(x)
	#define debugP(x)
#endif

using namespace std;
typedef long long ll;

list<int> data;
int n;
void solve() {
	cin >> n;
	int v;
	rep(i, 0, n) {
		cin >> v;
		data.push_back(v);
	}
	data.sort(greater<int>());
	//for (int i : data) debug(i);

	int ans = -1, before = data.front();
	for (int i : data) {
		if (before != i) {
			ans = i;
			break;
		}
	}
	cout << ans << endl;
}

int main() {
	solve();
	return 0;
}

Submission Info

Judge Result