[Solved]Top Songs 50 Marks Devise Algorithm Implement Program Solve Following Problem Similar One Q37246095
Top songs (50 marks) Devise an algorithm and implement it in aprogram to solve the following problem, similar to one often facedby an MP3 player. For our purposes, a song consists of thefollowing data fields: title (a nonempty ASCII string), composer (a(possibly empty) ASCII string), running time (a positive integer).Input consists of n songs and an integer k with 1 ≤ k ≤ n. Yourprogram must find the k songs with longest running times, andoutput these songs in descending order of length of song. If songshave the same running time, then we use lexicographic order on thetitle, and then on the composer, to get a total ordering. Thelexicographic order comes from the usual order on ASCII characters.• You should first make sure that your algorithm and implementationare correct! It is up to you to come up with test cases and thecorresponding correct output. Usually, if a program contains anerror, this can be detected on a small test case. You are allowedto share test cases with the class via the class forum. • Next youshould consider efficiency. Remember that the test cases may useany value of k and n. • Please see below for information on inputand output formats.
Input
Output
Please post the code in python is possible. Thanks 🙂
Pink Frost&Phillipps, Martin&234933 Se quel guerrier io fossi&Puccini, Giacomo&297539 Non piu andrai&Mozart&234933 M’appari tutt ‘amor&Flotow, F&252905 Se quel guerrier io fossi&Puccini, Giacomo&297539 M’appari tutt ‘amor&Flotow, F&252905 Non piu andrai&Mozart&234933 Show transcribed image text Pink Frost&Phillipps, Martin&234933 Se quel guerrier io fossi&Puccini, Giacomo&297539 Non piu andrai&Mozart&234933 M’appari tutt ‘amor&Flotow, F&252905
Se quel guerrier io fossi&Puccini, Giacomo&297539 M’appari tutt ‘amor&Flotow, F&252905 Non piu andrai&Mozart&234933
Expert Answer
Answer to Top songs (50 marks) Devise an algorithm and implement it in a program to solve the following problem, similar to one of… . . .
OR
