Many brands sell the same product, stored in two parallel vectors: ratings[i] is the rating of brands[i]. Find the highest-rated brand by scanning with a loop.
You start with:
vector<string> brands = {"TechPro", "MegaCorp", "Quantum", "NeoByte", "Zenith"};
vector<int> ratings = {4, 5, 3, 5, 4};
Build:
1. MegaCorp (5)
Rules:
- Keep the position of the best brand so far in
bestIndex, starting at0, and scan the positions from1to the end with a loop. - Update
bestIndexonly on a strictly higher rating. If two brands share the top rating, the one listed first wins (MegaCorpat position 1, notNeoByteat position 3). - Format the winner as
"1. Brand (rating)"and print it withcout << ... << endl.
Walk the positions with
for (int i = 1; i < (int)ratings.size(); i++) { and compare each rating with the best one so far.
C++ needs
to_string(...) to join a number to a string with +.
vector<string> brands = {"TechPro", "MegaCorp", "Quantum", "NeoByte", "Zenith"};
vector<int> ratings = {4, 5, 3, 5, 4};
int bestIndex = 0;
for (int i = 1; i < (int)ratings.size(); i++) {
if (ratings[i] > ratings[bestIndex]) {
bestIndex = i;
}
}
cout << "1. " << brands[bestIndex] << " (" << ratings[bestIndex] << ")" << endl;
Free plan: 30 tutor messages. Premium is unlimited.
Saved
Ctrl + Enter to check
