#include <bits/stdc++.h>
using namespace std;
string find2ndlargest(vector<string> arr) {
int first, second;
first = second = INT_MIN;
for (int i = 0; i < arr.size() ; i++) {
if (stoi(arr[i]) > first) {
second = first;
first = stoi(arr[i]);
}
else if (stoi(arr[i]) > second && stoi(arr[i]) != first) {
second = stoi(arr[i]);
}
}
if (second == INT_MIN)
return "-1";
else
return to_string(second);
}
int main(){
vector<string> arr;
arr.push_back("-214744801");
arr.push_back("-214744802");
// arr.push_back("5");
// arr.push_back("5");
// arr.push_back("5");
// arr.push_back("4");
// arr.push_back("2");
// arr.push_back("-2");
cout<<find2ndlargest(arr)<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgoKc3RyaW5nIGZpbmQybmRsYXJnZXN0KHZlY3RvcjxzdHJpbmc+IGFycikgewoKICAgIGludCBmaXJzdCwgc2Vjb25kOyAgCiAgICAKICAgIGZpcnN0ID0gc2Vjb25kID0gSU5UX01JTjsKCiAgICBmb3IgKGludCBpID0gMDsgaSA8IGFyci5zaXplKCkgOyBpKyspIHsgCiAgICAgICAgCiAgICAgICAgaWYgKHN0b2koYXJyW2ldKSA+IGZpcnN0KSB7IAogICAgICAgICAgICBzZWNvbmQgPSBmaXJzdDsgCiAgICAgICAgICAgIGZpcnN0ID0gc3RvaShhcnJbaV0pOyAKICAgICAgICB9CiAgICAgICAgZWxzZSBpZiAoc3RvaShhcnJbaV0pID4gc2Vjb25kICYmIHN0b2koYXJyW2ldKSAhPSBmaXJzdCkgewogICAgICAgICAgICBzZWNvbmQgPSBzdG9pKGFycltpXSk7IAogICAgICAgIH0KICAgIH0gCiAgICBpZiAoc2Vjb25kID09IElOVF9NSU4pIAogICAgICAgIHJldHVybiAiLTEiOyAKICAgIGVsc2UKICAgICAgICByZXR1cm4gdG9fc3RyaW5nKHNlY29uZCk7Cn0KCmludCBtYWluKCl7CgogICAgdmVjdG9yPHN0cmluZz4gYXJyOwogICAgYXJyLnB1c2hfYmFjaygiLTIxNDc0NDgwMSIpOwogICAgYXJyLnB1c2hfYmFjaygiLTIxNDc0NDgwMiIpOwogICAgLy8gYXJyLnB1c2hfYmFjaygiNSIpOwogICAgLy8gYXJyLnB1c2hfYmFjaygiNSIpOwogICAgLy8gYXJyLnB1c2hfYmFjaygiNSIpOwogICAgLy8gYXJyLnB1c2hfYmFjaygiNCIpOwogICAgLy8gYXJyLnB1c2hfYmFjaygiMiIpOwogICAgLy8gYXJyLnB1c2hfYmFjaygiLTIiKTsKICAgIGNvdXQ8PGZpbmQybmRsYXJnZXN0KGFycik8PGVuZGw7CgogICAgcmV0dXJuIDA7Cn0=