Logo
(追記) (追記ここまで)

3252번 - JANICA 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 128 MB32262686.667%

문제

Watching alpine skiing on TV can be really boring sometimes. Fortunately, it can happen that your TV operator doesn’t show all the information about the race and then you have to do some computation to determine the winner yourself.

Here are some details about a race: Each race consists of two rounds. In first round, N skiers numbered from 1 to N, race starting in that order.

When the first skier in the first round (numbered with 1) finishes the race we are given the time he/she needed to complete the course. For every following skier we are given time difference between his/her time and the time of the skier currently leading the race.

Only the best M skiers qualify for the second round and they start the second round ordered by time from the first round decreasingly (last skier qualified for the second round starts first and the leader after the first round start last).

In the second round we are given the total time (first and second round added) of the first skier racing, and then for every following skier we are given the time difference between his/her total time and the total time of the skier currently leading the race.

Write a program that will determine medal winners after the race has finished. You can assume that it can never happen that two skiers have same time (after the first round or after both rounds).

Time for any race will be between 10 and 300 seconds. All times will be real numbers with at most two decimal digits.

입력

The first line of the input file contains two integers N and M, separated by a single blank character, 3 ≤ M ≤ N ≤ 100.

The following line contains the time for the first skier in the first round, and the following N-1 lines contain the described time differences.

The following line contains the time for the first skier in the second round, and the following M-1 lines contain the described time differences.

출력

The first line of the output file should contain the number of the skier winning the gold medal, second line the number of skier winning the silver medal, and the third line the number of skier winning the bronze medal.

제한

예제 입력 1

3 3
25.13
+1.14
+2.18
45.08
+2.14
+3.11

예제 출력 1

3
2
1

예제 입력 2

4 3
29.18
+2.18
+0.05
+1.13
54.22
+1.23
+1.11

예제 출력 2

4
1
3

예제 입력 3

5 4
27.29
-1.02
+1.83
-0.43
+0.03
56.98
+1.83
-0.43
+0.03

예제 출력 3

5
4
1

힌트

출처

Olympiad > Croatian Highschool Competitions in Informatics > 2002 > Regional Competition - Juniors 2번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /