Red Blue Flowers Starters 61 Division 3 (Rated) Problem Solution

                         

This post is all about the solution of the "Red Blue Flowers" Starters 61 Division 3 (Rated) Problem Statement.

Codechef 

Problem Statement:

Cook has a vegetable patch full of NN cells. The second cell has R iR I red flowers and B iB I blue flowers. Cook could only take each type of flower (red or blue) out of each cell.

Let XX represent the entire number of red flowers collected by Cook and YY represent the entire number of blue flowers gathered by Cook. Cook wishes to maximise the value of mathrmmin(X, Y)min (X,Y). Could indeed you assist Cook?

Format of Input :

The very first line includes a single numeric value, TT, that also represents the number of tests. Then come the test cases.

Evey test case starts with a numeric NN indicating the number of cells in Chef's garden.

Evey test case's second sentence contains NN space-separated integer values R 1, R 2, dots, R NR 1,R 2,...,R N denoting the number of red flowers for each cell.

Evey test case's third category represents NN space-separated integer value B 1, B 2, dots, B NB 1,B 2,...,B N defining the amount of blue flowers in each compartment.

Format of the Output :

Output the highest benefit of mathrmmin(X, Y)min for every test case (X,Y).

Also Check this out:-

Odd Sum Pair Starters 61 Division 3 (Rated) Problem Solution Click Here

Minimise LCS Starters 61 Division 3 (Rated) Problem Solution Click Here

Weird Subarrays Starters 61 Division 3 (Rated) Problem Solution Click Here

Also Read :- Top Programming Languages of 2022 Click Here

Solution of the Problem: Click Here