Longitud de la subsecuencia más pequeña tal que la suma de los elementos es mayor que igual a K

Dada una array arr[] de tamaño N y un número K, la tarea es encontrar la longitud de la subsecuencia más pequeña tal que la suma de la subsecuencia sea mayor o igual que el número K.
Ejemplo: 
 

Entrada: arr[] = {2, 3, 1, 5, 6, 3, 7, 9, 14, 10, 2, 5}, K = 35 
Salida: 4 
subsecuencias más pequeñas con la suma mayor o igual que la dada suma K es {7, 9, 14, 10}
Entrada: arr[] = {1, 2, 2, 2, 3, 4, 5, 4, 7, 6, 5, 12}, K = 70 
Salida: – 1 
No es posible una subsucesión con suma mayor que igual a la suma dada.

Acercarse: 
 

• Este problema se puede resolver con la ayuda de la cola de prioridad
• Atraviese la array de entrada e inserte cada elemento de la array en la cola de prioridad.
• Inicialice las variables que contienen la suma del elemento seleccionado de la cola de prioridad y la variable para obtener el recuento del elemento seleccionado de la cola de prioridad a 0
• Extraiga los elementos de la cola de prioridad hasta que la cola de prioridad no esté vacía 
  1. Añadir el elemento en la suma
  2. Aumente el recuento porque el elemento se selecciona para contribuir a la suma total
  3. Verifique si la suma es mayor que el número K dado . Si es así, deje de verificar y emita el conteo.

A continuación se muestra la implementación del enfoque anterior.
 

// C++ implementation to find length of smallest
// subsequence such that sum of elements
// is greater than equal to given number K
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to find the smallest
// subsequence such that sum of elements
// is greater than equal to given number K
int lengthOfSmallestSubsequence(int K, vector<int> v)
{
    // Initialize priority queue
    priority_queue<int> pq;
 
    // Loop to insert all elements into
    // the priority queue
    for (int i = 0; i < v.size(); i++) {
        pq.push(v[i]);
    }
    int sum = 0, count = 0;
 
    // Loop to find the smallest
    // subsequence such that sum of elements
    // is greater than equal to given number K
    while (!pq.empty() && sum < K) {
        sum += pq.top();
        pq.pop();
        count++;
    }
    // If sum is less than K
    // then return -1 else return count.
    if (sum < K) {
        return -1;
    }
    return count;
}
 
// Driver code
int main()
{
 
    vector<int> v{ 2, 3, 1, 5,
                   6, 3, 7, 9,
                   14, 10, 2, 5 };
    int K = 35;
 
    cout << lengthOfSmallestSubsequence(K, v);
 
    return 0;
}

// Java implementation to find length of smallest
// subsequence such that sum of elements
// is greater than equal to given number K
import java.util.*;
 
class GFG
{
 
// Function to find the smallest
// subsequence such that sum of elements
// is greater than equal to given number K
static int lengthOfSmallestSubsequence(int K, int []v)
{
    // Initialize priority queue
    Queue<Integer> pq =
            new PriorityQueue<Integer>(Collections.reverseOrder());
 
    // Loop to insert all elements into
    // the priority queue
    for (int i = 0; i < v.length; i++)
    {
        pq.add(v[i]);
    }
    int sum = 0, count = 0;
 
    // Loop to find the smallest
    // subsequence such that sum of elements
    // is greater than equal to given number K
    while (!pq.isEmpty() && sum < K)
    {
        sum += pq.peek();
        pq.remove();
        count++;
    }
     
    // If sum is less than K
    // then return -1 else return count.
    if (sum < K)
    {
        return -1;
    }
    return count;
}
 
// Driver code
public static void main(String[] args)
{
    int []v = { 2, 3, 1, 5,
                6, 3, 7, 9,
                14, 10, 2, 5 };
    int K = 35;
    System.out.print(lengthOfSmallestSubsequence(K, v));
}
}
 
// This code is contributed by Rajput-Ji

# Python3 implementation to find length of smallest
# subsequence such that sum of elements
# is greater than equal to given number K
 
# Function to find the smallest
# subsequence such that sum of elements
# is greater than equal to given number K
def lengthOfSmallestSubsequence(K, v):
     
    # Initialize priority queue
    pq = []
 
    # Loop to insert all elements into
    # the priority queue
    for i in v:
        pq.append(i)
    pq.sort()
 
    sum = 0
    count = 0
 
    # Loop to find the smallest
    # subsequence such that sum of elements
    # is greater than equal to given number K
    while (len(pq) > 0 and sum < K):
        sum += pq[-1]
        del pq[-1]
        count += 1
     
    # If sum is less than K
    # then return -1 else return count.
    if (sum < K):
        return -1
    return count
 
# Driver code
v = [2, 3, 1, 5,
    6, 3, 7, 9,
    14, 10, 2, 5]
K = 35
 
print(lengthOfSmallestSubsequence(K, v))
 
# This code is contributed by mohit kumar 29

// C# implementation to find length of smallest
// subsequence such that sum of elements
// is greater than equal to given number K using System;
using System;
using System.Collections.Generic;
using System.Linq;
class GFG
{
 
  // Function to find the smallest
  // subsequence such that sum of elements
  // is greater than equal to given number K
  static int lengthOfSmallestSubsequence(int K, int []v)
  {
 
    // Initialize List
    List<int> pq = new List<int>();
 
    // Loop to insert all elements into
    // the List
    for (int i = 0; i < v.Length; i++) 
    {
      pq.Add(v[i]);
    }
 
    // Sort list in reverse order
    pq.Sort();
    pq.Reverse();
    int sum = 0;
    int count = 0;
 
    // Loop to find the smallest
    // subsequence such that sum of elements
    // is greater than equal to given number K
    while(pq.Count > 0 && sum < K)
    {
      sum += pq[0];
      pq.RemoveAt(0);
      count++;
    }
 
    // If sum is less than K
    // then return -1 else return count.
    if (sum < K)
    {
      return -1;
    }
    return count;
  }
 
  // Driver code
  static public void Main ()
  {
    int []v = { 2, 3, 1, 5,6, 3, 7, 9, 14, 10, 2, 5 };
    int K = 35;
    Console.WriteLine(lengthOfSmallestSubsequence(K, v));
  }
}
 
// This code is contributed by avanitrachhadiya2155

<script>
 
// JavaScript implementation to find length of smallest
// subsequence such that sum of elements
// is greater than equal to given number K using System;
 
// Function to find the smallest
// subsequence such that sum of elements
// is greater than equal to given number K
function lengthOfSmallestSubsequence(K, v) {
 
    // Initialize List
    let pq = new Array();
 
    // Loop to insert all elements into
    // the List
    for (let i = 0; i < v.length; i++) {
        pq.push(v[i]);
    }
 
    // Sort list in reverse order
    pq.sort((a, b) => b - a);
 
    let sum = 0;
    let count = 0;
 
    // Loop to find the smallest
    // subsequence such that sum of elements
    // is greater than equal to given number K
    while (pq.length > 0 && sum < K) {
        sum += pq[0];
        pq.splice(0, 1);
        count++;
    }
 
    // If sum is less than K
    // then return -1 else return count.
    if (sum < K) {
        return -1;
    }
    return count;
}
 
// Driver code
let v = [2, 3, 1, 5, 6, 3, 7, 9, 14, 10, 2, 5];
let K = 35;
document.write(lengthOfSmallestSubsequence(K, v));
 
// This code is contributed by gfgking
 
</script>

4