#competitive programing

Use green-colored balloons for the first problem and purple-colored balloons for the second problem

Use purple-colored balloons for the first problem and green-colored balloons for the second problem

You are given the cost of each balloon and problems that each participant solve. Your task is to print the minimum price that you have to pay while purchasing balloons.

SOLUTION

#include <iostream>

using namespace std;

int MinPricePurchasingBalloons()

{    

 int cost_green_balloon , cost_purple_balloon , n;

cin >> cost_green_balloon;    

cin >> cost_purple_balloon;    

cin >> n;

    int status1 , status2;     int total1 = 0 , total2 = 0;

    while (n--)    

{        

cin >> status1;        

cin >> status2;

total1 += cost_green_balloon * status1 + cost_purple_balloon * status2;

total2 += cost_purple_balloon * status1 + cost_green_balloon * status2;    

}        

return total1 < total2 ? total1 : total2;

}

int main() 

{    

int t;    

cin >> t; while(t--)    

{        

cout << MinPricePurchasingBalloons() << endl;   

 }        

return 0;