## Restaurant Customers cses problem solution -

### Problem Statement-

• Time limit: 1.00 s
•
• Memory limit: 512 MB
You are given the arrival and leaving times of $n$ customers in a restaurant.

What was the maximum number of customers?

Input

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

After this, there are $n$ lines that describe the customers. Each line has two integers $a$ and $b$: 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
• $1\le n\le 2\cdot {10}^{5}$
• $1\le a
Example

Input:
35 82 43 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 -

1. can u give me soulution

1. #include
using 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;
}

### codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

### Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi

### Concert Tickets Cses Problem set solution | Concert Tickets Cses Problem set solution Using multiset

Concert Tickets Cses Problem set solution- Porblem statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  concert tickets available, each with a certain price. Then,  m m  customers arrive, one after another. Each customer announces the maximum price he or she is willing to pay for a ticket, and after this, they will get a ticket with the nearest possible price such that it does not exceed the maximum price. Input The first input line contains integers  n n  and  m m : the number of tickets and the number of customers. The next line contains  n n  integers  h 1 , h 2 , … , h n h 1 , h 2 , … , h n : the price of each ticket. The last line contains  m m  integers  t 1 , t 2 , … , t m t 1 , t 2 , … , t m : the maximum price for each customer. Output Print, for each customer, the price that they will pay for their ticket. After this, the ticket cannot be purchased again. If a customer cannot get any ticket, print  − 1 − 1 . Constraints 1 ≤ n , m ≤ 2 ⋅ 10 5 1 ≤ n , m ≤ 2 ⋅