Guest User

Untitled

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