ГлавнаяСборникиТурнирыРазделыФорумыУчастникиПечатьПомощьО системе

Сборники > Фёдор Меньшиков. Тренировки > задача:


012. 50352 - Selling Cows

Гость
• Вопросы к жюри (1)

Задачи сборника

• 003. 50358 - Series of Odd Numbers
• 004. 50424 - Area
• 004. 50522 - Multiplication Table - 2
• 005. 50297 - Divisible By Five
• 006. 50293 - Sum of odd numbers f...
• 007. 50401 - Sum of Odd Numbers
• 009. 50783 - Numri me i vogel
• 010. 50782 - Max of N integers
• 012. 50352 - Selling Cows
• 012. 50589 - Numri i vezeve te shitura
• 015. 50466 - Drawing Square From...
• 016. 50463 - Drawing a Triangle
• 017. 50423 - Numbers square
• 017. 50537 - esreveR Triangle
• 018. 50344 - Profit or Loss
• 018. 50491 - Brokers
• 018. 50787 - Expected Value

Обратная связь

Если у вас есть предложения или пожелания по работе Contester, посетите форум сайта www.contester.ru.

Лимит времени 2000/4000/4000/4000 мс. Лимит памяти 65000/65000/65000/65000 Кб.
Question by Ibrahim Mesecan (imesecan@gmail.com).

Selling Cows

Farmer John has many cows. Time to time he goes to sell some of them. He doesn't sell a cow if it's smaller than or equal to certain weight (w). And, he tries to sell the smallest one that is heavier than w.

Question:
Write a program that finds the cow that is the smallest of the ones which are heavier than w kgs.

Input specification
You will be given two integer numbers (n and w) at the beginning where 1 ≤ n ≤ 5000 and 1 ≤ k ≤ 1000. Then, in the following n lines, you will be given n integers: the weights of n cows.

Output specification
Show just one integer number: the position of the first cow which complies the given condition. If there is no cow that is heavier than w then show -1.
Note: Positions start from 1.

 Sample Input I   
  7 10
  7 15 10 8 17 11 20
 Sample Input II   
  6 50
  12 30 28 7 41 50
 Sample Output I   
  6
 Sample Output II   
  -1


Для отправки решений необходимо выполнить вход.

www.contester.ru