Super Scores
I am sure all of you know about SAT Superscore. Superscoring is the process by which colleges consider the highest section scores across all the dates a student took the SAT. Rather than confining the scores to one particular date, this approach will take the student's highest section scores, forming the highest possible composite score. Let us solve a generic problem here. Let us start with a sample input and output 2 3
700 800 775 775 800 700 800 800 1600
First line of input specifies 2 sections and 3 takes for this student. So, we need to find the best score for each section across all the test takes & output the best section scores and the corresponding total - next 3 lines show the scores for each section for each take - For this sample input/output, student got 800 in both sections, so the final total is 1600 Your program should be generic to handle any # of sections and any # of takes 2591421130838 5 int main() 6 int nursections, nuntakes, naxScores; cin >> nun sections >> nuntakes; 9 maxScores - new int [numSections); //dynamic memory allocation of arnay! 10 11 // initialize the array 12 for(int 1-e; Icnum Sections; i++) 13 maxScores[1] - ; 14 15 //CODE HERE 16 17 1/output the max score for each section and compute & output total too. 18 int total -e; 19 for(int 1-e; Icnum Sections; 1.) { 20 cout << maxScores[1] << **; 21 total + maxScores[i]; 22 ) 23 cout << total; 24 ) I

Respuesta :

Answer:

Replace:

//CODE HERE  

//output the max score for each section and compute & output total too.  

with the following lines of codes:

int num;  

for(int i=0; i<numtakes; i++) {

for(int j=0; j<numsections; j++) {

  cin>>num;

  if(num>maxScores[j]){

      maxScores[j] = num;    }

}  }

Explanation:

Your program is poorly formatted. (See attachment for correct presentation of question)

What's required of the us is to complete the source program.

The codes has been completed in the Answer section above, however, the line by line explanation is as follows:

This line declares num that gets user for input for each entry

int num;  

This line iterates through the number of takes

for(int i=0; i<numtakes; i++) {

This line iterates through the number of sections

for(int j=0; j<numsections; j++) {

This gets user input for each entry

  cin>>num;

The following if condition determines the greatest entry in each section

  if(num>maxScores[j]){

      maxScores[j] = num;    }

}  }

For further explanation, I've added the complete source file as an attachment where I used comments to explain each line.

Ver imagen MrRoyal