All moose are knigs of the forest, but your latest moose-friend, Karl-Algtav, is more interesting than most. In part because of his fondness of fermented blueberries, and in part because of the tribe he lives in. Each year his tribe holds a tournament to determine that year's alphamoose. The winner gets to mate with all the moose-chicks, and then permanently leaves the tribe. The pool of contenders stays constant over the years, apart from the old alpha-moose being replaced by a newcomer in each tournament.
KarlAlgtav has recently begun to wonder when it will be his turn to win all the chicks, and has asked you to help him determine this. He has supplied a list of the strength of each of the other male moose in his tribe that will compete during the next n-1 years, along with their time of entry into the tournament. Assuming that the winner each year is the moose with greatest strength, determine when KarlAlgtav becomes the alpha-moose.
Note that exactly k of the moose will have 2011 as their year of entry, and that the re-
maining n - 1 moose will have unique years of entry.
You may assume that the strength of each moose is unique.
입력 2 4 2013 2 2011 1 2011 3 2014 4 2012 6 출력 2013 입력 2 4 2011 1 2013 2 2012 4 2011 5 2014 3 출력 unknown
출처: The 2011 Nordic Collegiate Programming Contest problem F