#include <bits/stdc++.h>
using namespace std;
const long long MOD=1e9+7;
int lonthunhi(vector<int> &a) {
int n=a.size();
int lon1=-1,lon2=-1;
//Tên biến ko phải thứ bạn đang nghĩ đâu hihi!
//Tìm biến lớn nhất!
for (int i=0;i<n;i++) {
if (a[i]>lon1)
lon1=a[i];
}
// Tìm số lớn thứ hai!
for (int i=0;i<n; i++) {
// Cập nhật liên tục
if (a[i]>lon2 && a[i]!=lon1) {
lon2=a[i];
}
}
return lon2;
}
int main() {
vector<int> a = {36,67,69};
cout << lonthunhi(a);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmNvbnN0IGxvbmcgbG9uZyBNT0Q9MWU5Kzc7CmludCBsb250aHVuaGkodmVjdG9yPGludD4gJmEpIHsKICAgIGludCBuPWEuc2l6ZSgpOwogICAgaW50IGxvbjE9LTEsbG9uMj0tMTsKICAgIC8vVMOqbiBiaeG6v24ga28gcGjhuqNpIHRo4bupIGLhuqFuIMSRYW5nIG5naMSpIMSRw6J1IGhpaGkhCiAgICAvL1TDrG0gYmnhur9uIGzhu5tuIG5o4bqldCEKICAgIGZvciAoaW50IGk9MDtpPG47aSsrKSB7CiAgICAgICAgaWYgKGFbaV0+bG9uMSkKICAgICAgICAgICAgbG9uMT1hW2ldOwogICAgfQogICAgLy8gVMOsbSBz4buRIGzhu5tuIHRo4bupIGhhaSEKICAgIGZvciAoaW50IGk9MDtpPG47IGkrKykgewogICAgICAgIC8vIEPhuq1wIG5o4bqtdCBsacOqbiB04bulYwogICAgICAgIGlmIChhW2ldPmxvbjIgJiYgYVtpXSE9bG9uMSkgewogICAgICAgICAgICBsb24yPWFbaV07CiAgICAgICAgfQogICAgfQogICAgcmV0dXJuIGxvbjI7Cn0KIAppbnQgbWFpbigpIHsKICAgIHZlY3RvcjxpbnQ+IGEgPSB7MzYsNjcsNjl9OwogICAgY291dCA8PCBsb250aHVuaGkoYSk7CiAKICAgIHJldHVybiAwOwp9