- Shopping It Is A Busy Day At The Shop Your Father Is Out To Buy Some Groceries And You Have To Handle The Shop It Is Y 1 (304.07 KiB) Viewed 47 times
- Shopping It Is A Busy Day At The Shop Your Father Is Out To Buy Some Groceries And You Have To Handle The Shop It Is Y 2 (242.13 KiB) Viewed 47 times
Shopping It is a busy day at the shop. Your father is out to buy some groceries and you have to handle the shop. It is your job to make as many sales as possible and make your father proud. There are N buyers waiting in line to buy things. Each buyer takes some amount of time to decide what to buy. Some of the buyers are in a hurry, so they would go away if they have not reached their tum in I time. You decide to process those customers who require less time. (Deciding time is not included in waiting time) You are given a list of N buyers showing the amount of time T0), 1¹¹ buyer will wait for its turn. You are also given a list of N buyers showing the amount of time required by the buyer to make the purchase. Input Specification: input1: Number of buyers input2: Array of size input to show the time buyer will wait for input3: Array of size input!" to show the time required by the buyer Output Specification: Your function must return an integer showing the maximum number of customers processed. Example 1: Input1:8 input2: (2 1,3 9.7, 125, 13) input3: 1, 3, 6, 92, 3,13) Output: 5 Explanation: The customers are processed in order 2->5->7->12-13 (number is waiting time). Example 2:
C 1 2 3 4 5 6 7 8 9 10 Compiler: gcc 5.4.0 #include<stdio.h> #include<string.h> // Read only region start int shopping (int input1, int input2[], int input3 []) { // Read only region end // write code here