Submission #4074789

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
int main(){
    int N;
    cin >> N;
    int A[100];
    for(int i=0;i<N;i++)
        cin >> A[i];
    
    // 降順ソート
    sort(A, A + N, greater<int>());
    for(int i=0;i<N;i++){
        if(A[i] != A[0]){
            cout << A[i] << endl;
            return 0;
        }
    }
    return 0;
}

Submission Info

Judge Result