import java.util.LinkedList;
import java.util.PriorityQueue;

public class stonesAndJewels {

    public static void main (String args[]) {

        Integer[] mArray = {1,2,2,4,5,8,9,1,2,3,6,13};

        int max = 0;
        int premax = 0;

        if (mArray[0] > mArray[1]) { max = mArray[0]; premax = mArray[1];}
        else { max = mArray[1]; premax = mArray[0];}  // max = 4, premax = 1

        for (int i = 2; i < mArray.length; i++) {
            System.out.println(mArray[i]);
            //if (max > mArray[i] && mArray[i]> premax) { premax = mArray[i];}
            //if (max > mArray[i] && mArray[i]< premax) { premax = mArray[i];}
            if (max < mArray[i]) {premax = max; max = mArray[i];}
        }

        System.out.println("Максималка: " + max);
        System.out.println("Предмаксималка: " + premax);
    }
}