1863.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1863 on 2005-09-23 at 20:41:21 */ 
#include <stdio.h>
#include <stdlib.h>

int cmp(const void *, const void *);

int main()
{
    long N, i;
    int j, num[10], flag;
    
    scanf("%ld", &N);
    for(i = 0; i < N; i++) {
        for(j = 0; j < 10; j++) {
            scanf("%d", &num[j]);
        }
        qsort(num, 10, sizeof(int), cmp);
        flag = 0;
        for(j = 0; j < 10; j++) {
            if(flag == 1) {
                putchar(' ');
            }
            printf("%d", num[j]);
            flag = 1;
        }
        putchar('\n');
    }
    
    return 0;
}

int cmp(const void *a, const void *b)
{
    if(*(int*)a < *(int*)b) {
        return -1;
    } else {
        return 1;
    }    
}