1. #include <stdio.h>
    2. #include<algorithm>
    3. using namespace std;
    4. void process()
    5. {
    6.     int a[100] = { 0 };int odd[100] = { 0 };
    7.     int even[100] = { 0 };
    8.     int num = 0;int count_odd = 0; int count_even = 0;
    9.     scanf("%d", &num);
    10.     int i = 0;
    11.     for (i = 0; i < num; i++) {
    12.         scanf("%d", &a[i]);
    13.     }
    14.     for (i = 0; i < num; i++) {
    15.         if (a[i] % 2 == 0) {
    16.             even[count_even] = a[i];
    17.             count_even++;
    18.         }
    19.         if (a[i] % 2 == 1) {
    20.             odd[count_odd] = a[i];
    21.             count_odd++;
    22.         }
    23.     }
    24.     stable_sort(odd, odd + count_odd);
    25.     stable_sort(even,even+count_even);
    26.     for (i = 0; i < count_odd; i++) {
    27.         printf("%d ", odd[i]);
    28.     }
    29.     for (i = 0; i < count_even; i++) {
    30.         printf("%d ", even[i]);
    31.     }
    32.     printf("\n");
    34. }
    35. int main()
    36. {
    37.     int n;
    38.     int i;
    39.     scanf("%d", &n);
    40.     for (i = 0; i < n; i++)
    41.     {
    42.         process();
    43.     }
    44.     return 0;
    45. }