#include #include #include void sort_q(int *a,int n){ if(n<=8) return; int p=rand()%n; int pivot=a[p]; a[p]=a[0]; int l=1; int r=n-1; while(l<=r){ if(a[l]==pivot){ printf("NO\n"); exit(0); } else if(a[l]=0 && a[j]>p){ a[j+1]=a[j]; j--; } a[j+1]=p; } return; } void run(void){ int n; scanf("%d",&n); int *x; x=(int *)malloc(sizeof(int)*n); int i; for(i=0;i