nyoj236心急的c小加

#include<stdio.h>#include<stdlib.h>struct node{int l;int w;}s[1005];int cmp(const void *a,const void *b){if(((struct node *)a)->l!=((struct node *)b)->l)return (((struct node *)a)->l>((struct node *)b)->l?1:-1);elsereturn (((struct node *)a)->w-((struct node *)b)->w);}int main(){int t,n,i,j;scanf("%d",&t);while(t--){scanf("%d",&n);int k,count=0;for(i=0;i<n;i++)scanf("%d%d",&s[i].l,&s[i].w);qsort(s,n,sizeof(s[0]),cmp);        for(i=0;i<n;i++){k=s[i].w;if(k!=0){count++;for(j=i+1;j<n;j++)if(s[j].w>=k){k=s[j].w;s[j].w=0;}}}printf("%d\n",count);}}      //已AC