Submission #1606791

---

Source Code Expand

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

using namespace std;

int main(){
	int n,ans,i;
	vector<int> v;
	cin >> n;
	for(i=0;i<n;i++){
		cin >> ans;
		v.push_back(ans);
	}
	
	sort(v.begin(),v.end());
	
	i=n-2;
	ans=v[n-1];
	while(1){
		if(ans>v[i]){
			ans=v[i];
			break;
		}
		i--;
	}
	
	cout << ans << endl;
	
return 0;
}

Submission Info

Judge Result