poj之3671 字符串排序

#include<iostream>#include<stdlib.h>#include<stdio.h>#include<ctype.h>#include<string.h>using namespace std;char *s[1000];int i;int cmp(const void *a,const void *b){ return(strcmp(*(char **)a,*(char **)b));}int main(){ for(i=0;i<5;i++) {   s[i]=(char*)malloc(sizeof(char*));   cin>>s[i]; } qsort(s,5,sizeof(s[0]),cmp); for(i=0;i<5;i++)  cout<<s[i]<<endl; return 0;}