Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- int n,m;
- int sort[100],record[100];
- int cmp(const void *a,const void *b)
- {
- int x=*(int*)a;
- int y=*(int*)b;
- return(x<y?-1:x>y?1:0);
- }
- int search(int take_point,int star)
- {
- int j,i;
- if(take_point==m)
- {
- for(i=0;i<m;i++)
- printf("%d ",sort[record[i]]);
- printf("\n");
- }
- else
- {
- for(j=star;j<n;j++)
- {
- record[take_point]=j;
- search(take_point+1,j+1);
- }
- }
- }
- int main(i)
- {
- while(scanf("%d",&n)!=EOF&&n!=0)
- {
- for(i=0;i<n;i++) scanf("%d",&sort[i]);
- qsort(sort,n,4,cmp);
- scanf("%d",&m);
- search(0,0);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement