Skip to content
Related Articles

Related Articles

Improve Article

Check if X and Y elements can be selected from two arrays respectively such that the maximum in X is less than the minimum in Y

  • Difficulty Level : Expert
  • Last Updated : 16 Apr, 2021

Given two arrays arr1[] and arr2[] consisting of N and M integers respectively, and two integers X and Y, the task is to check if it is possible to choose X elements from arr1[] and Y elements from arr2[] such that the largest among these X elements is less than the minimum element among these Y elements. If it is possible, then print “Yes”. Otherwise, print “No”.

Examples:

Input: arr1[] = {1, 1, 1, 1, 1}, arr2[] = {2, 2}, X = 3, Y = 1
Output: Yes
Explanation: Every possible selection satisfies the above condition as every element of arr1[] is less than minimum element in the arr2[].

Input: arr1[] = {1, 2, 3}, arr2[] = {3, 4, 5}, X = 2, Y = 1
Output: Yes
Explanation: One possible selection is take elements at indices 0 and 1 from arr1[] and indices 0 from arr2[], i.e {1, 2} and {3}.

 

Approach: The idea is to sort both the arrays in ascending order and then, choose the first X elements from arr1[] and the last Y elements from arr2[]. Follow the steps below to solve the problem:



  • Sort both the arrays in ascending order.
  • If X is greater than N or Y is greater than M, then print “No” as it is not possible to choose any such combinations.
  • Otherwise, if the value of arr1[X – 1] is less than arr2[M – Y], then print “Yes”.
  • Otherwise, print “No”. If none of the above conditions are satisfied.

Below is the implementation of the above approach:

C++




// C++ program for the above approach
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to check if it is possible to
// choose X and Y elements from a[] and
// b[] such that maximum element among
// X element is less than minimum
// element among Y elements
string check(int a[], int b[], int Na,
             int Nb, int k, int m)
{
    // Check if there are atleast X
    // elements in arr1[] and atleast
    // Y elements in arr2[]
    if (Na < k || Nb < m)
        return "No";
 
    // Sort arrays in ascending order
    sort(a, a + Na);
    sort(b, b + Nb);
 
    // Check if (X - 1)-th element in arr1[]
    // is less than from M-Yth element
    // in arr2[]
    if (a[k - 1] < b[Nb - m]) {
        return "Yes";
    }
 
    // Return false
    return "No";
}
 
// Driver Code
int main()
{
    int arr1[] = { 1, 2, 3 };
    int arr2[] = { 3, 4, 5 };
    int N = sizeof(arr1) / sizeof(arr1[0]);
    int M = sizeof(arr2) / sizeof(arr2[0]);
 
    int X = 2, Y = 1;
 
    // Function Call
    cout << check(arr1, arr2, N, M, X, Y);
 
    return 0;
}
Java



// Java program for the above approach
import java.io.*;
import java.util.*;
 
class GFG{
 
// Function to check if it is possible to
// choose X and Y elements from a[] and
// b[] such that maximum element among
// X element is less than minimum
// element among Y elements
static String check(int[] a, int[] b,
                    int Na, int Nb,
                    int k, int m)
{
     
    // Check if there are atleast X
    // elements in arr1[] and atleast
    // Y elements in arr2[]
    if (Na < k || Nb < m)
        return "No";
 
    // Sort arrays in ascending order
    Arrays.sort(a);
    Arrays.sort(b);
 
    // Check if (X - 1)-th element in arr1[]
    // is less than from M-Yth element
    // in arr2[]
    if (a[k - 1] < b[Nb - m])
    {
        return "Yes";
    }
 
    // Return false
    return "No";
}
 
// Driver Code
public static void main(String[] args)
{
    int[] arr1 = { 1, 2, 3 };
    int[] arr2 = { 3, 4, 5 };
    int N = arr1.length;
    int M = arr2.length;
 
    int X = 2, Y = 1;
 
    // Function Call
    System.out.println(check(
        arr1, arr2, N, M, X, Y));
}
}
 
// This code is contributed by Dharanendra L V
Python3



# Python3 program for the above approach
 
# Function to check if it is possible to
# choose X and Y elements from a[] and
# b[] such that maximum element among
# X element is less than minimum
# element among Y elements
def check( a, b, Na, Nb, k, m):
   
  # Check if there are atleast X
  # elements in arr1[] and atleast
  # Y elements in arr2[]
  if (Na < k or Nb < m):
    return "No"
 
  # Sort arrays in ascending order
  a.sort()
  a.sort()
 
  # Check if (X - 1)-th element in arr1[]
  # is less than from M-Yth element
  # in arr2[]
  if (a[k - 1] < b[Nb - m]):
    return "Yes"
 
  # Return false
  return "No"
 
# Driver Code
arr1 = [ 1, 2, 3 ]
arr2 = [ 3, 4, 5 ]
N = len(arr1)
M = len(arr2)
X = 2
Y = 1
 
# Function Call
print(check(arr1, arr2, N, M, X, Y))
 
# This code is contributed by rohitsongh07052.
C#



// C# program for the above approach
using System;
 
class GFG{
 
// Function to check if it is possible to
// choose X and Y elements from a[] and
// b[] such that maximum element among
// X element is less than minimum
// element among Y elements
static string check(int[] a, int[] b,
                    int Na, int Nb,
                    int k, int m)
{
     
    // Check if there are atleast X
    // elements in arr1[] and atleast
    // Y elements in arr2[]
    if (Na < k || Nb < m)
        return "No";
 
    // Sort arrays in ascending order
    Array.Sort(a);
    Array.Sort(b);
 
    // Check if (X - 1)-th element in arr1[]
    // is less than from M-Yth element
    // in arr2[]
    if (a[k - 1] < b[Nb - m])
    {
        return "Yes";
    }
 
    // Return false
    return "No";
}
 
// Driver Code
static public void Main()
{
    int[] arr1 = { 1, 2, 3 };
    int[] arr2 = { 3, 4, 5 };
    int N = arr1.Length;
    int M = arr2.Length;
 
    int X = 2, Y = 1;
 
    // Function Call
    Console.WriteLine(check(
        arr1, arr2, N, M, X, Y));
}
}
 
// This code is contributed by Dharanendra L V
Javascript



<script>
// javascript program for the above approach   
// Function to check if it is possible to
    // choose X and Y elements from a and
    // b such that maximum element among
    // X element is less than minimum
    // element among Y elements
    function check(a,  b , Na , Nb , k , m)
    {
 
        // Check if there are atleast X
        // elements in arr1 and atleast
        // Y elements in arr2
        if (Na < k || Nb < m)
            return "No";
 
        // Sort arrays in ascending order
        a.sort();
        b.sort();
 
        // Check if (X - 1)-th element in arr1
        // is less than from M-Yth element
        // in arr2
        if (a[k - 1] < b[Nb - m]) {
            return "Yes";
        }
 
        // Return false
        return "No";
    }
 
    // Driver Code
        var arr1 = [ 1, 2, 3 ];
        var arr2 = [ 3, 4, 5 ];
        var N = arr1.length;
        var M = arr2.length;
 
        var X = 2, Y = 1;
 
        // Function Call
        document.write(check(arr1, arr2, N, M, X, Y));
 
// This code is contributed by todaysgaurav
</script>
Output: 
Yes
 
Time Complexity: O(N*log N)
Auxiliary Space O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.
In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.



My Personal Notes
arrow_drop_up
Previous
Check if all array elements can be reduced to less than X
Next

Minimum time required to fill given N slots
Recommended Articles
Page :
Maximize sum of K elements selected from a Matrix such that each selected element must be preceded by selected row elements
02, Dec 20
Check if a triplet of buildings can be selected such that the third building is taller than the first building and smaller than the second building
25, May 21
Maximum sum such that exactly half of the elements are selected and no two adjacent
27, Apr 20
Check if two items can be selected from two different categories without exceeding price
22, May 20
Sum of elements in 1st array such that number of elements less than or equal to them in 2nd array is maximum
17, Apr 19
Count N-length arrays made from first M natural numbers whose subarrays can be made palindromic by replacing less than half of its elements
16, Dec 20
Arrange N elements in circular fashion such that all elements are strictly less than sum of adjacent elements
11, Jul 19
Reduce sum of same-indexed elements of two arrays to less than K by rearranging the second array
14, Jan 21
Maximize count of elements that can be selected having minimum difference between their sum and K
18, Jan 21
Check if any subarray can be made palindromic by replacing less than half of its elements
02, Dec 20
Check if all array elements can be reduced to less than X
20, Jan 21
Remove Minimum coins such that absolute difference between any two piles is less than K
10, Jul 19
Count the maximum number of elements that can be selected from the array
29, May 19
Find maximum number of elements such that their absolute difference is less than or equal to 1
30, Oct 18
Maximum product from array such that frequency sum of all repeating elements in product is less than or equal to 2 * k
18, Feb 19
Sum of all array elements less than X and greater than Y for Q queries
18, Jun 20
Maximum elements that can be removed from front of two arrays such that their sum is at most K
25, May 21
Minimize swaps required to make the first and last elements the largest and smallest elements in the array respectively
23, Mar 21
Generate an Array in which count of even and odd sum sub-arrays are E and O respectively
06, May 19
Distribute given arrays into K sets such that total sum of maximum and minimum elements of all sets is maximum
20, Jul 21
Length of longest subarray in which elements greater than K are more than elements not greater than K
14, Aug 19
Minimum number of array indices required to be selected to make the sum of a set greater than another
30, Jul 21
Find K such that array A can be converted into array B by adding K to a selected range [L, R]
04, Feb 20
Maximize score of same-indexed subarrays selected from two given arrays
15, Jun 21
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
aditya7409
@aditya7409
Vote for difficulty
Current difficulty :
Expert





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox