fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int tt(long int arr[],long int dep[],long int n)
  4. {
  5. sort(arr, arr+n);
  6. sort(dep, dep+n);
  7. long int plat_needed = 1, result = 1;
  8. long int i = 1, j = 0;
  9. while (i < n && j < n)
  10. {
  11. if (arr[i] <= dep[j])
  12. {
  13. plat_needed++;
  14. i++;
  15. if (plat_needed > result)
  16. result = plat_needed;
  17. }
  18. else
  19. {
  20. plat_needed--;
  21. j++;
  22. }
  23. }
  24.  
  25. return result;
  26. }
  27. int main() {
  28. // your code goes here
  29. long int len,n;
  30. cin>>n;
  31. len=n;
  32. long int start[n+1],end[n+1],s=0,e=0;
  33. while(n--)
  34. {
  35. long int h1,m1,h2,m2;
  36. cin>>h1>>m1>>h2>>m2;
  37. if(m1<10)
  38. start[s++]=h1*10+m1;
  39. else
  40. start[s++]=h1*100+m1;
  41. if(m2<10)
  42. end[e++]=h2*10+m2;
  43. else
  44. end[e++]=h2*100+m2;
  45. }
  46. for(int i=0;i<s;i++)
  47. cout<<end[i]<<" ";
  48. cout<<endl;
  49. cout<<tt(start,end,len)<<endl;
  50. return 0;
  51. }
Success #stdin #stdout 0s 15232KB
stdin
6
1 0 2 0
16 0 21 30
9 30 13 0
21 30 22 30
21 30 22 30
12 0 12 30
stdout
20 2130 130 2230 2230 1230 
3