• there are multiple competitors in a race
• there are multiple races (2-16) in a single competition

• after each race competitors position is assigned in order they finished (1, 2, 3, ..) it can happen they finished at the same time (1, 1, 2, 3)!
• the points are assigned in the same order as position based on the pointing system, the simples point system is (1, 2, 3, 4, ...)
• if some of the competitors finished on the same position the points are splitted between them (position: 1, 1, 2; points: 1.5, 1.5, 3)
• the rank is assigned based on points if some of the competitors has the same number of points, they have the same rank but the next rank is left out (points: 1.5, 1.5, 3, 4, rank: 1, 1, 3, 4)

• the result of competition is simple a sum of race points for each competitor
• there can be specified that the n worst races can be discarded (leave out, not used)
• there are special rules how to handle ties (when you have competitors on the same place in competition results)

Calculate ranks and points for all three races (data can be found in these files: data1/race1.csv, data1/race2.csv, data1/race3.csv).

The program should load these csv files and prints out (output to console) the table that includes: Competitor, Rank, Points. This table should have 15 rows, that means one row per competitor.

For discards n=1 (the worst race shouldn't be taken into account). Ties doesn't need to be handled.

The application should be a simple console application no UI. The code changes should be done on your fork (that means first you need to fork the repo and there do all the changes)