## Restaurant Customers cses problem solution -

### Problem Statement-

**Time limit:**1.00 s**Memory limit:**512 MB

What was the maximum number of customers?

**Input**

The first input line has an integer : the number of customers.

After this, there are lines that describe the customers. Each line has two integers and : the arrival and leaving times of a customer.

You may assume that all arrival and leaving times are distinct.

**Output**

Print one integer: the maximum number of customers.

**Constraints**

**Example**

Input:

`3`

5 8

2 4

3 9

Output:

`2`

### solution-

Step 1- take input in a vector which contain pair of int and bool and insert arrival time as true and leaving time as false.

Step 2- sort the vector.

stem 3- iterate over vector and when you found true update max if max > ans

step 4- else if you strike false update ans as ans-1

Here is code solution -

can u give me soulution

ReplyDelete#include

Deleteusing namespace std;

#define int long long int

int32_t main(){

ios::sync_with_stdio(false);

cin.tie(NULL);

int n;

cin>>n;

vector> v;

int x; int y;

while(n--){

cin>>x;cin>>y;

v.push_back(make_pair(x,true));

v.push_back(make_pair(y,false));

}

sort(v.begin(),v.end());

int ans =0; int maxx =0;

for(int i=0;i<v.size();i++){

if(v[i].second==true){

ans++;

maxx = max(ans,maxx);

}else{

ans--;

}

}

cout<<maxx<<endl;

return 0;

}