Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?

Problem S. 19. (September 2006)

S. 19. We are given a file with the following types and record structure:

Name: 35 characters
Address: 50 characters
Phone: 12 characters
Score: integer (numbers between 0 and 6000 are stored)

The file contains a few hundred thousand pieces of data and is sorted according to ``name''. Prepare your program to list the data corresponding to the middle three people, but, this time ``score'' as a sorting criteria. If more people fall in the middle when sorted according to ``score'', then you should display the data corresponding to all of them. You should display the results on the screen, you should not create a new file and should not write into the existing one (for example, you should not sort it). As a further constraint, you have at most 64 KB of memory available. The source code should be submitted.

(10 pont)

Deadline expired on October 16, 2006.

Sorry, the solution is available only in Hungarian. Google translation

Ócsvári Ádám (Budapest, ELTE Radnóti M. Gyak. Isk.)




25 students sent a solution.
10 points:Ócsvári Ádám.
9 points:Fehér András, Kezes Balázs, Szebeni Szilveszter.
8 points:1 student.
7 points:2 students.
6 points:4 students.
5 points:8 students.
4 points:3 students.
2 points:1 student.
0 point:2 students.

Problems in Information Technology of KöMaL, September 2006