Guest User

Untitled

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