Besta gjöfin

Question

Solution

Idea

Time Complexity: O(n)O(n)

This question is not hard, kind of "give-away". The basic idea is to use the struct array and find the name of the element whose number is the biggest (Linear Search).

Code

https://github.com/mendax1234/Coding-Problems/blob/main/kattis/bestagjofin/bestagjofin.c

Last updated