{"problem":{"name":"093. Music Non Stop","description":{"content":"Music Non Stop You're trying to find the longest possible piece of music, so that you can play music non-stop. Given a list of songs and their durations (in MM:SS, with leading zeros), figure out whi","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10269093"},"statements":[{"statement_type":"Markdown","content":"Music Non Stop\n\nYou're trying to find the longest possible piece of music, so that you can play music non-stop. Given a list of songs and their durations (in MM:SS, with leading zeros), figure out which song is the longest.\n\nThe first line of input contains a positive integer $n$: the number of songs. The next $n$ lines contain a string, representing the song title, a space, and the song's duration, in MM:SS format with leading zeroes. (For example, a song that was 7 minutes and 9 seconds long would be written as 07:09).\n\nOutput a single string: the name of the longest song given in the input. If two songs have the same length, output the one that comes first in the input.\n\n## Input\n\nThe first line of input contains a positive integer $n$: the number of songs. The next $n$ lines contain a string, representing the song title, a space, and the song's duration, in MM:SS format with leading zeroes. (For example, a song that was 7 minutes and 9 seconds long would be written as 07:09).\n\n## Output\n\nOutput a single string: the name of the longest song given in the input. If two songs have the same length, output the one that comes first in the input.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of songs.  \nLet $ S = \\{(t_i, d_i) \\mid i \\in \\{1, \\dots, n\\}\\} $ be the set of song entries, where:  \n- $ t_i \\in \\mathbb{S} $ is the song title (string),  \n- $ d_i \\in \\mathbb{S} $ is the duration in MM:SS format.  \n\nDefine the function $ f: \\mathbb{S} \\to \\mathbb{Z} $ that converts MM:SS to total seconds:  \n$$ f(\\text{MM:SS}) = 60 \\cdot \\text{MM} + \\text{SS} $$  \nwhere MM and SS are the integer values of the minute and second parts.\n\n**Constraints**  \n1. $ 1 \\leq n \\leq 100 $ (implicit from context)  \n2. Each $ d_i $ is a string of the form \"MM:SS\" with $ 00 \\leq \\text{MM} \\leq 99 $, $ 00 \\leq \\text{SS} \\leq 59 $  \n\n**Objective**  \nFind the song $ (t_j, d_j) \\in S $ such that:  \n$$ j = \\min\\left\\{ i \\in \\{1, \\dots, n\\} \\mid f(d_i) = \\max_{1 \\leq k \\leq n} f(d_k) \\right\\} $$  \nOutput $ t_j $.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10269093","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}