Advertisement
Guest User

Untitled

a guest
May 6th, 2015
188
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.25 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int main()
  5. {
  6. int n;
  7. while (1) {
  8. scanf("%d", &n);
  9. if (n == 0)
  10. break;
  11. int a[10000] = { 0 }, b[10000] = { 0 }, i = 0;
  12. for (i = 0; i < n; i++)
  13. scanf("%d", &a[i]);
  14. for (i = 0; i < n; i++)
  15. scanf("%d", &b[i]);
  16.  
  17. int x[60001] = { 0 }, y[60001] = { 0 }; /*用來暫存及排序用的陣列*/
  18. for (i = 0; i < n; i++) {
  19. x[a[i]]++;
  20. y[b[i]]++;
  21. }
  22.  
  23. int j = 0, sum = 0, k;
  24. i = 0;
  25. while (sum < n) {
  26. sum += x[i];
  27. k = x[i];
  28. while (k-- > 0) {
  29. a[j] = i;
  30. j++;
  31. }
  32. i++;
  33. }
  34. i = 0;
  35. j = 0;
  36. sum = 0;
  37. while (sum < n) {
  38. sum += y[i];
  39. k = y[i];
  40. while (k-- > 0) {
  41. b[j] = i;
  42. j++;
  43. }
  44. i++;
  45. }
  46.  
  47. sum = 0;
  48. i = 0;
  49. j = 0;
  50. while (i < n && j < n) {
  51. if (a[i] < b[j]) {
  52. sum++;
  53. j++;
  54. i++;
  55. } else {
  56. j++;
  57. }
  58. }
  59.  
  60. printf("%d\n", sum);
  61. }
  62. return 0;
  63. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement