 What's up guys? My name is Michael and welcome to my YouTube channel. Today we are going to go over this problem called fashion shows, spodged fashion shows. It's another ad hoc problem. Basically you have like a matching dating service and then matches them and they want to maximize the hotness bond between two couples. And the man is rated at hotness level X and a woman is rated at a hotness level Y. The value of the hotness bond is X times Y and basically we want to return the maximum hotness for all couples. Okay? We want to like pair them in such a way that they're maximum hotness. Both fashion shows contain participants each and your job is to find the sum of the hotness bonds for all the couples that MMDS has proposed. This is a very easy problem. Basically it's an easy problem. So you know that the hotness bond is X times Y and if you want to maximize the hotness bonds for all couples you want to get the maximum of all the values and pair them up the hotness level of X for all the men, right? All the men's hotness level, the maximum of those and then pair them up with the maximum hotness level of woman and sum them all up and then that'll be the maximum hotness bonds for all couples. That's basically how you do this problem. Read them both in, sort them in increasing order and multiply them both together and sum them all up. That's basically how you do this problem. And I'll just explain the code to you guys. Our guys, so this is the code, basically read a number of test cases while T minus minus will decrease the number of test cases that we're going to read in the number of people, right? And then we create two vectors, which is the arrays of both men and women. And then we read in, we loop through both of them reading in both the men's values and the woman's values. Then what we do is we just sort both of them, sort the men and sort the woman, right? Now we have a sum variable equals zero and then we're just going to add up the multiplication of each men's value and the woman's value, multiply them together and then we just print out the sum. So that's basically how you do this problem. It's not that difficult. Yeah, that's pretty much it. Ready to come subscribe? I'll check you guys out.