47 teams scored 1905 points on this task, for a maximum score of 100, an average score of 41 and a median score of 30.
In Jobstown, where time and payments are intertwined, a skilled worker named Alex is trying to put together a nest egg. is a sum of money saved or invested for a specific purpose, often for retirement or a major purchase. Alex found out that there are N jobs available in the city, each with a completion time T_i and a corresponding payment P_i (in byte-dollars). Alex has to select some jobs to do, with the freedom to perform the same job multiple times: note that he can only work for one job at any given moment (but after finishing a job, he can start working on a new one immediately), and he receives the payment for the job only after finishing it completely (half-finished work is not tolerated in Jobstown!). Alex occasionally finds himself working for too many days straight, though: this time, he decided to place a limit on the amount of work he will do, namely no more than M total time of work will be done by him...