You are putting together some music CDs for a party. You have arranged a list of songs in the order in which you want to play them for each CD. However, you would like to minimize the empty time left at the end of each CD. Assume a CD can hold up to 80 minutes of music. You want to figure out the total time for a group of songs for multiple CDs and see how well the songs that you have picked fit on 80-minute CDs. For each CD you want to see how the time accumulates, how much time is left on any one CD, and how much total music time will be played if all the CDs are played consecutively.
Program Input Description
The input to the program will consist of an unknown number of CD data sets. Each CD data set will have information for one set of songs on one CD. The data sets should be processed until end of file. Each CD data set will have a number indicating the number of songs on that CD, followed by the playing-time for each song. The playing-time for each song will be in the format:
Number-for-minutes followed by Number-for-seconds (e.g. 4 47)
The above data indicates that a song takes 4 minutes and 47 seconds.
This is what I have::
#include <iostream>
#include <iomanip>
using namespace std;
const int MAX_MINUTES = 80;
const int MIN_MINUTES = 1;
const int MAX_SECONDS = 59;
const int MIN_SECONDS = 1;
const int
int main ()
{
int songnum;
int minutes;
int seconds;
int minute;
int second;
int count = 0;