in c++ vs19: Go on https://www.imdb.com/ and look up for some movies. Select at least 10 movies. For each movie you choose, store its title into an array called movies and its rate (score) into a...

in c++ vs19:

Go on https://www.imdb.com/ and look up for some movies. Select at least 10 movies. For each movie you choose, store its title into an array called movies and its rate (score) into a second array called ratings. The same information for a single movie must be stored in elements having the same index in the two arrays. For example, if Jurassic Park is the third movie you choose, then both its title and its rate should have index 2.
movies[2] = "Jurassic Park";
rating[2] = 8.1;
Once you filled your arrays, print the list of all the movies from the highest score to the lowest. Follow this format:
number_in_ranking. movie_title (movie_rate) newline
If two movies have the same rate, their order doesn’t matter.
Note: You cannot use structs, you cannot use classes, you cannot use matrices, you cannot use advanced data structures, you cannot use std::swap.
Note: You can use templates if you need to.
Remember to comment the code such that it is easy for other developers to understand it.
Example (with 5 movies, you need at least 10):
Input:
movies[5] = {"The Godfather", "Home Alone", "Jurassic Park", "The Matrix", "Forrest Gump"};
ratings[5] = {9.2, 7.6, 8.1, 8.7, 8.8}
Output:
1. The Godfather (9.2)
2. Forrest Gump (8.8)
3. The Matrix (8.7)
4. Jurassic Park (8.1)
5. Home Alone (7.6)
Explanation: The list ranks the movies from highest rate to lowest: The Godfather is the movie with highest score (9.2) so it is the first one to be printed out; Home Alone is the movie with lowest score, so it is the last one to be printed out.
Constraints:
• 10 <= number="" of="" movies=""><= 100="" (this="" means="" you="" can="" have="" from="" 10="" to="" 100="">