fork(1) download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define MAXN 100003
  4. pair<int,int> Time[MAXN];/*
  5. bool mycmp(const pair<int,int>&a ,const pair<int,int> &b)
  6. {
  7.   if(a.second==b.second)
  8.   return (a.first<=b.first);
  9.   else
  10.   return (a.second <=b.second);
  11. }*/
  12. int maxActivities(int n)
  13. {
  14. int i,j,f,c;
  15.  
  16.  
  17. f=Time[0].first;
  18. i=1;c=1;
  19. while(i<n)
  20. {
  21. while(i<n && Time[i].second<f)
  22. i++;
  23. if(i==n)
  24. break;
  25.  
  26. f=Time[i].first;
  27. c++;
  28. i++;
  29.  
  30. }
  31.  
  32. return c;
  33. }
  34. int main()
  35. {
  36. int T,n;
  37. int i,j;
  38.  
  39. scanf("%d",&T);
  40. while(T--)
  41. {
  42. scanf("%d",&n);
  43. for(i=0;i<n;i++)
  44. scanf("%d %d",&(Time[i].second),&(Time[i].first));
  45. // scanf("%d %d",&(Time[i].first),&(Time[i].second));
  46.  
  47. //sort(Time,Time+n,mycmp);
  48. sort(Time,Time+n);
  49.  
  50. // printf("max no of activities that can be performed is %d\n",maxActivities(n));
  51. printf("%d\n",maxActivities(n));
  52. }
  53.  
  54.  
  55. return 0;
  56. }
  57.  
Success #stdin #stdout 0s 3468KB
stdin
3

3

3 9

2 8

6 9


4

1 7

5 8

7 8

1 8

 

6

7 9

0 10

4 5

8 9

4 10

5 7
stdout
1
2
3