HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Search > problem:


51055 - The competition

Guest
• Review clarifications (3)

Section problems

• 50483 - Group Total
• 51078 - Max trade
• 50500 - Find Student
• 50786 - Top Question
• 50788 - Eight Puzzle
• 50504 - School contest
• 51056 - Welcome Picnic
• 50787 - Expected Value
• 51055 - The competition
• 50859 - Low performance
• 50826 - Olive Containers
• 50866 - Buy the cheapest
• 51077 - Grades Histogram
• 50785 - Swimming Contest
• 50999 - Overlapping Trips
• 50507 - Sequential Numbers
• 51057 - Number of students

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.

Q2

The Sensitive Society Club organizes a donation campaign. To put more fun in the campaign, they organize a competition among departments. In the competition top donating students and the department are awarded with a certificate.

Question: Write a program that reads the information for n students then it shows

  • the name of the student who donated the most amount
  • and the department whose average is the highest

Input specification: You will be given one integer (n) in the beginning. Then, the following n lines will have three information:

  • Student name: names are at most 20 char strings containing only 26 English (uppercase or lowercase) letters
  • his/her department: at most 4 chars long string (only 3 departments in the competition: CEN, ECE or BINF)
  • The amount donated: a positive integer not greater than 20,000
where n is between 1 and 10,000.

Output specification: Show two strings:

  • the name of the student who donated the most,
  • The department whose average is the highest.
Note: If there are two students with the same value, show the first one.

Sample Input
6
Alban CEN 15
Redi ECE 7
Erda CEN 4
Kei BINF 9
Ardi BINF 11
Arli ECE 12

Sample Output
Alban BINF



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

www.contester.ru