Qsort 二级排序

#include <cstdio>
#include <cstdlib>


struct Node{
int x;
int y;
}s[10];


int Comp(const void *a, const void *b)
{
    struct Node *c = (Node *)a;
    struct Node *d = (Node *)b;


    if( c->x != d->x) return c->x - d->x;
    else return c->y -d->y;
}


int main()
{
    for(int i =0; i<5; i++)
    {
        scanf("%d %d",&s[i].x,&s[i].y);
    }
    qsort(s, 5, sizeof(s[0]), Comp);
    for(int i =0;i<5;i++)
    {
        printf("%d %d\n", s[i].x, s[i].y);
    }
    return 0;
}
/*
5 3
5 1
4 2
3 4
6 1
*/