# Find the total guests that are present at the party

A person hosts a party and invites N guests to it. However, each guest has a condition, that each guest ‘Gi’ only stays at the party if there are at least ‘Pi’ people already at the party, otherwise leaves. The total number of guests N and the number of people each guest needs ‘Pi’ are given as input for each guest. The task is to find the total guests that are present at the party. It is also given that **the guests arrive at the party in the order given in the array ‘Pi’**

**Examples:**

Input:N = 5, Pi = {1, 0, 2, 1, 3}Output:2Explanation:Since 5 guests are invited to the party. Total guest present initially = 0 For Guest number 1: The 1st guest needs at least 1 person, since he is the first to arrive, and there is no one else, so he leaves. Therefore, Total guest so far = 0 For Guest number 2: The 2nd guest needs 0 people, so he stays. Therefore, Total guest so far = 0 + 1 = 1 For Guest number 3: The 3rd guest needs at least 2 people, And there are still only 1 guest present, so he leaves. Therefore, Total guest so far = 1 + 0 = 1 For Guest number 4: The 4th guest needs at least 1 people, And there is 1 guest present, so he stays. Therefore, Total guest so far = 1 + 1 = 2 For Guest number 5: The 5th guest needs at least 3 people, And there is only 2 guest present, so he leaves. Therefore, Total guest so far = 2 + 0 = 2 Total guests that are present at the party = 2.Input:N = 3, Pi = {0, 2, 1}Output:2Explanation:Since 3 guests are invited to the party. Total guest present initially = 0 For Guest number 1: The 1st guest needs 0 people, so he stays. Therefore, Total guest so far = 1 For Guest number 2: The 2nd guest needs at least 2 people, And there are still only 1 guest present, so he leaves. Therefore, Total guest so far = 1 + 0 = 1 For Guest number 3: The 3rd guest needs at least 1 people, And there is 1 guest present, so he stays. Therefore, Total guest so far = 1 + 1 = 2 Total guests that are present at the party = 2.

**Approach:**

- Get the number of guests invited in N and the requirement of each guest in array guest[].
- Initialize totalGuests to 0, as the total number of guests present.
- Iterate in the array guest[] from 0 to N-1.
- If the requirement of the guest is less than or equal to totalGuests, Increment totalGuests by 1
- When complete array guest[] has been traversed, print the total number of guests ‘totalGuests’

**Implementation:**

## C++

`// C++ program to get the ` `// total number of guests at the party ` ` ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find the totalGuests ` `int` `findGuest(` `int` `array[], ` `int` `N) ` `{ ` ` ` `// Total guest before the party are 0 ` ` ` `int` `count = 0; ` ` ` ` ` `// Checking requirements for each guest ` ` ` `for` `(` `int` `i = 0; i < N; i++) { ` ` ` ` ` `// If requirements are met ` ` ` `if` `(array[i] <= count) { ` ` ` ` ` `// The Gi guest decides to stay ` ` ` `// So increment total guest by 1 ` ` ` `count++; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Return the totalnumber of guest ` ` ` `return` `count; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` ` ` `// Get the number of guests invited ` ` ` `int` `N = 5; ` ` ` ` ` `// Guests array stores ` ` ` `// the requirement by each guest ` ` ` `int` `guests[] = { 1, 0, 2, 1, 3 }; ` ` ` ` ` `// Get the total number of guests present ` ` ` `int` `totalGuests = findGuest(guests, N); ` ` ` ` ` `cout << totalGuests << endl; ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to get the ` `// total number of guests at the party ` `class` `GFG ` `{ ` ` ` `// Function to find the totalGuests ` `static` `int` `findGuest(` `int` `array[], ` `int` `N) ` `{ ` ` ` `// Total guest before the party are 0 ` ` ` `int` `count = ` `0` `; ` ` ` ` ` `// Checking requirements for each guest ` ` ` `for` `(` `int` `i = ` `0` `; i < N; i++) ` ` ` `{ ` ` ` ` ` `// If requirements are met ` ` ` `if` `(array[i] <= count) ` ` ` `{ ` ` ` ` ` `// The Gi guest decides to stay ` ` ` `// So increment total guest by 1 ` ` ` `count++; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Return the totalnumber of guest ` ` ` `return` `count; ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` ` ` `// Get the number of guests invited ` ` ` `int` `N = ` `5` `; ` ` ` ` ` `// Guests array stores ` ` ` `// the requirement by each guest ` ` ` `int` `guests[] = { ` `1` `, ` `0` `, ` `2` `, ` `1` `, ` `3` `}; ` ` ` ` ` `// Get the total number of guests present ` ` ` `int` `totalGuests = findGuest(guests, N); ` ` ` ` ` `System.out.println(totalGuests); ` `} ` `} ` ` ` `// This code is contributed by Code_Mech ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program to get the ` `# total number of guests at the party ` ` ` `# Function to find the totalGuests ` `def` `findGuest(guests, N): ` ` ` `count ` `=` `0` ` ` ` ` `# Checking requirements for each guest ` ` ` `for` `i ` `in` `range` `(N): ` ` ` ` ` `# If requirements are met ` ` ` `if` `guests[i] <` `=` `count: ` ` ` ` ` `# The Gi guest decides to stay ` ` ` `# So increment total guest by 1 ` ` ` `count ` `+` `=` `1` ` ` ` ` `# Return the totalnumber of gues ` ` ` `return` `count ` ` ` `# Driver code ` `N ` `=` `5` `guests ` `=` `[` `1` `, ` `0` `, ` `2` `, ` `1` `, ` `3` `] ` `totalGusets ` `=` `findGuest(guests, N) ` `print` `(totalGusets) ` ` ` `# This code is contributed by Shrikant13 ` |

*chevron_right*

*filter_none*

## C#

`// C# program to get the ` `// total number of guests at the party ` `using` `System; ` ` ` `class` `GFG ` `{ ` ` ` ` ` `// Function to find the totalGuests ` ` ` `static` `int` `findGuest(` `int` `[] array, ` `int` `N) ` ` ` `{ ` ` ` `// Total guest before the party are 0 ` ` ` `int` `count = 0; ` ` ` ` ` `// Checking requirements for each guest ` ` ` `for` `(` `int` `i = 0; i < N; i++) ` ` ` `{ ` ` ` ` ` `// If requirements are met ` ` ` `if` `(array[i] <= count) ` ` ` `{ ` ` ` ` ` `// The Gi guest decides to stay ` ` ` `// So increment total guest by 1 ` ` ` `count++; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Return the totalnumber of guest ` ` ` `return` `count; ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `Main () ` ` ` `{ ` ` ` ` ` `// Get the number of guests invited ` ` ` `int` `N = 5; ` ` ` ` ` `// Guests array stores ` ` ` `// the requirement by each guest ` ` ` `int` `[] guests = { 1, 0, 2, 1, 3 }; ` ` ` ` ` `// Get the total number of guests present ` ` ` `int` `totalGuests = findGuest(guests, N); ` ` ` ` ` `Console.WriteLine(totalGuests); ` ` ` `} ` `} ` ` ` `// This code is contributed by ihritik ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to get the ` `// total number of guests at the party ` ` ` ` ` `// Function to find the totalGuests ` `function` `findGuest(` `$array` `, ` `$N` `) ` `{ ` ` ` `// Total guest before the party are 0 ` ` ` `$count` `= 0; ` ` ` ` ` `// Checking requirements for each guest ` ` ` `for` `(` `$i` `= 0; ` `$i` `< ` `$N` `; ` `$i` `++) ` ` ` `{ ` ` ` ` ` `// If requirements are met ` ` ` `if` `(` `$array` `[` `$i` `] <= ` `$count` `) ` ` ` `{ ` ` ` ` ` `// The Gi guest decides to stay ` ` ` `// So increment total guest by 1 ` ` ` `$count` `++; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Return the totalnumber of guest ` ` ` `return` `$count` `; ` `} ` ` ` ` ` `// Driver code ` ` ` `// Get the number of guests invited ` `$N` `= 5; ` ` ` `// Guests array stores ` `// the requirement by each Guest ` `$guests` `= ` `array` `(1, 0, 2, 1, 3 ); ` ` ` `// Get the total number of guests present ` `$totalGuests` `= findGuest(` `$guests` `, ` `$N` `); ` ` ` `echo` `$totalGuests` `; ` ` ` `// This code is contributed by ihritik ` ` ` `?> ` |

*chevron_right*

*filter_none*

**Output:**

2

## Recommended Posts:

- Puzzle | Marriage Party
- Find the total marks obtained according to given marking scheme
- Sum of all palindrome numbers present in an Array
- Sum of all perfect numbers present in an array
- Sum of all mersenne numbers present in an array
- Check if a word is present in a sentence
- Check whether the Average Character of the String is present or not
- Sum of all the numbers present at given level in Modified Pascal’s triangle
- Total area of two overlapping rectangles
- Puzzle 3 | (Calculate total distance travelled by bee)
- Count the total number of triangles after Nth operation
- Puzzle | Guess the total number of coins
- Total money to be paid after traveling the given number of hours
- Minimum number of letters needed to make a total of n
- Total number of Spanning trees in a Cycle Graph

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.