Submission #1768079

---

Source Code Expand

#include <iostream>
#include<algorithm>
using namespace std;

int main() {
	int n;
	cin >> n;
	int a[n];
	for(int i = 0;i < n;i++) cin >> a[i];
	int len=sizeof(a)/sizeof(int);
	sort(a,a+len);
	int most,more;
	most = a[0];
	more = 0;
	for(int i = 0;i < n;i++){
		if (most < a[i])
		{
			more = most;
			most = a[i];
		}
	}
	cout << more << endl;
	return 0;
}

Submission Info

Judge Result