#include #include #include #include using namespace std; using CustomersBook=map>; using U=unsigned; using Lstring=list; Lstring pizza_points(const CustomersBook&,const U&,const U&); int main() { CustomersBook customers{ {"JustinBieber",{22,30,11,17,15,52,27,12}}, {"Spider-Man",{5,17,30,33,40,22,26,10,11,45}}, {"Mirielle",{10,64,32,76,71,21,14,36,5}}, {"Diego",{34,52,153,50,37,33}}, {"Oma",{1,2,3,4,5,6,7,8,9,10,20,30}}, {"Uni",{6,5,4,88,99,22,11,5,4,8,32}}, {"Cepagrave",{34,52,7,8,19,12}}, {"Louis",{12,23,34,45,21,32,43}}, {"Raphael🐢",{909,99,98,88,99,98,88,88}}, {"Leonardo🐢",{99,99,99,999,99,99,99}}, {"Donatello🐢",{99,999,999,99,99,99,999}}, {"Michelangelo🐢",{99,99,99,99,999,98,988,999999}} }; for(auto &c:pizza_points(customers,5,20)) cout<=Y)++count;}); if(count>=N) result.push_front((*c).first); } return result; }//2020 /* Restaurant in New york city will be launching a network of autonomous pizza delivery drones and wants you to create a flexible rewards system (Pizza Points) that can be tweaked in the future. The rules are simple: if a customer has made at least N orders of at least Y price, they get a FREE pizza! So you'll create a function that takes a dictionary of customers, a minimum number of orders and a minimum order price then return a list of customers that are eligible for a free pizza. Examples customers = { "JustinBieber": [22, 30, 11, 17, 15, 52, 27, 12], "Spider-Man": [5, 17, 30, 33, 40, 22, 26, 10, 11, 45] } pizza_points(customers, 5, 20) ➞ ["Spider-Man"] pizza_points(customers, 3, 10) ➞ ["JustinBieber", "Spider-Man"] pizza_points(customers, 5, 100) ➞ [] Notes ⚠️Sort the returned array of customer names in alphabetical order. */

pizza points