Advertisement
raisul82

monitoring process incomplite

Oct 18th, 2016
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.32 KB | None | 0 0
  1. #include<stdio.h>
  2. struct monitoring
  3. {
  4. int x;
  5. int y;
  6. };
  7. int main()
  8. {
  9. int n,m,i,j,k,l,a,b,max,v=0,T;
  10. scanf("%d",&T);
  11. while(v++,T-- &&scanf("%d",&n)==1)
  12. {
  13.  
  14. m=n*2;
  15. int arr2[m];
  16. struct monitoring arr[m],temp;
  17. for(i=0; i<m; i++)
  18. {
  19. scanf("%d",&arr[i].x);
  20. if(i%2==0)
  21. {
  22. arr[i].y=1;
  23. }
  24. else
  25. {
  26. arr[i].y=-1;
  27.  
  28. }
  29. }
  30. for(j=0; j<m; j++)
  31. {
  32. for(k=j+1; k<m; k++)
  33. {
  34. if(arr[j].x>arr[k].x)
  35. {
  36. temp=arr[j];
  37. arr[j]=arr[k];
  38. arr[k]=temp;
  39.  
  40. }
  41. else if(arr[j].x==arr[k].x && arr[j].y<arr[k].y)
  42. {
  43. temp=arr[j];
  44. arr[j]=arr[k];
  45. arr[k]=temp;
  46. }
  47.  
  48. }
  49. }
  50.  
  51.  
  52. for(a=0; a<m; a++)
  53. {
  54. arr[a+1].y=arr[a].y+arr[a+1].y;
  55. }
  56. max=arr[0].y;
  57. for(i=1; i<m; i++)
  58. {
  59. if(max<arr[i].y)
  60. {
  61. max=arr[i].y;
  62. }
  63. }
  64. printf("Case %d: %d\n",v,max);
  65.  
  66. }
  67.  
  68. return 0;
  69. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement