ONE KINGDOME!!

N one dimensional kingdoms are represented as intervals of the form [a_i , b_i] on the real line.
A kingdom of the form [L, R] can be destroyed completely by placing a bomb at a point x on the real line if L
≤ x ≤ R.

Your task is to determine minimum number of bombs required to destroy all the one dimensional kingdoms.

OR

THERE ARE MANY HORIZONTAL LINES  PARALALL TO X AXIX   . FIND MINIMUM NO OF VERTICAL LINE NEEDED TO CUT ALL   LINES ....

#########################################EDITORIAL######################################

###########################################CODE###########################################

1. #include<iostream>
2. using namespace std;
3. #include<algorithm>
4. int main()
5. {
6. int t;
7. cin>>t;
8. while(t--)
9. {
10. long long int m,n;
11. cin>>n>>m;
12. long long int arr[m];
13. for(int i=0;i<m;i++)
14. cin>>arr[i];
15. sort(arr,arr+m);
16. int sum=0,f=0;
17. for(int i=0;i<m;i++)
18. {
19. sum+=arr[i];
21. if(arr[i]*(arr[i]+1)/2-sum<arr[i])
22. {
23. if(arr[i]%2==1) cout<<"Chef\n";
24. else
25. cout<<"Mom\n";
27. // cout<<arr[i]<<endl;
28. f=1;
29. break;
30. }
33. }
34. if(f==0)
35. {
36. if((n*(n+1)/2-sum)%2==0) cout<<"Chef\n";
37. else
38. cout<<"Mom\n";
39. }
40. }
41. return 0;
42. }