class Solution {

	List<Print> printList = new LinkedList<Print>();

    public static int solution(int[] priorities, int location) {
        int answer = 0;

        List<Print> printList = new LinkedList<Print>();

        for(int i = 0; i<priorities.length; i++) {
        	printList.add(new Print(i, priorities[i]));
        }


        while (!printList.isEmpty()) {
			Print target = printList.get(0);
        	printList.remove(0);

        	Print max = maxValue(printList);


    		if(target.priority >= max.priority) {
        		answer++;
                //원하는 location이라면 break
        		if(target.location == location) {        		
        			break;
        		}
        	}else {
        		printList.add(target);
        	}        	
		}
        return answer;
    }

    //리스트에서 가장 큰 Print 객체를 반환
    public static Print maxValue(List<Print> list ) {    	
    	if(list.isEmpty()) {
        	// 리스트가 비어 있다면 없는 값을 반환
    		return new Print(-1, 0);
    	}

    	Print result = list.get(0);

    	for(Print temp : list) {
    		if(temp.priority > result.priority) {
    			result = temp;
    		}
    	}    	
    	return result;
    }

}

class Print{
	int location;
	int priority;

	public Print(int location, int priority) {
		this.location = location;
		this.priority = priority;
	}
}