Submission #174273

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
using namespace std;

//おぼえていないの
//sort(begin(a),end(a));
//stack<int> st; st.push(data) st.pop() st.top()
//stack<int> qt; //at.push(data) qt.pop() qt.front()
//vector<int> hoge(num)
//vector< vector<int> > v (max1, vector<int>(max2) );
//cin>>;
//cout<<endl;

int a,b;
vector<int> data(1000);
int ans=0;
int main(){
	cin >> a;

	for(int i=0;i<a;i++) cin >> data[i];
	sort(begin(data),end(data));
	cout << data[a-2]<<endl;	

	return 0;
}

Submission Info

Judge Result