# DCP-64: Friendship Restaurant Back to All Problems

Samiul and Ansary are best friends . They start catering business together after their graduation . They named their restaurant as Friendship Restaurant an ironic symbol of trust , respect and love between friends . But as a start up they have limited amount of money . Even they need to borrow tables everyday from Abir’s store house. Ansary has an imaginary fairy girlfriend who comes every night and tells him the arrival and leaving time of tomorrow’s customers . Customers don’t like to share a table with others. If there is no empty table when they arrive , they immediately leave the restaurant and may not come here again . So Samiul and Ansary must ensure a minimum number of tables are present in the restaurant so that at least one table is available for him/her on his/her arrival time .The same table can be used for non overlapping customers . Can you help them to ensure the minimum number of tables for tomorrow’s customer. Input: ------ Input starts with an integer **T ( T <= 30 )** denoting the number of test cases . Each case starts with a line containing an integer **n ( n <= 40 )** denoting number of customers . Each of the next n lines containing two integers **Ai and Li ( 1 <= Ai < Li <= 1000 )** denoting arrival time and leaving time of every customer . Output: ------- For each case, print the case number and the minimum number of table needs for tomorrow . Sample Input ------------ 2 2 1 3 3 5 4 1 10 10 20 11 21 3 5 Sample Output ------------- Case 1: 2 Case 2: 2

### Problem Limits

 Language Time Limit (seconds) C/C++ 3.00 Java 5.00 C# 5.00 PHP 5.00

# 18/63

Solve/Submission

### Ranking

# User Language Timing
01 smjlord068 Cpp 0.25s
02 dmehrab06 Cpp 0.25s
03 ih_hira Cpp 0.27s
04 Skyfall009 Cpp 0.43s
05 Pabon_SEC Cpp 0.44s
06 SIR_MBSTU Cpp 0.46s
07 aniscseiu Cpp 0.47s
08 sohelcseiu Cpp 0.48s
09 nafistiham Cpp 0.49s