ACM (TJU) : 2859


#include <iostream>
#include <algorithm>
using namespace std;

int main ()
{
    int n;

    while ( cin >> n && n ) {

        int highest = 0;
        int second_highest = 0;
        int input;

        cin >> input;
        highest = input;

        cin >> input;
        second_highest = input;

        if (second_highest > highest)
            swap (second_highest, highest);

        for ( int i = 2; i < n; i++ ) {

            cin >> input;

            if ( highest < input ) {
                second_highest = highest;
                highest = input;
            }

            else if ( input < highest && input > second_highest )
                second_highest = input;
        }

        cout << second_highest << endl;

    }

    return 0;
}

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s