Sort strings lexicographically using STL sort

use string array

#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
bool cmp(string a,string b){
    return a < b; //按字典序从小到大排列 
} 

int main(){
    string s[3];
    s[0] = "wu";s[1]="jia";s[2]="jun";
    sort(s,s+3,cmp);
    for(int i = 0;i < 3;i++){
        cout << s[i]<<" ";
    }
}

Use char two-dimensional array (string will time out in some cases)

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

char name[3][4] = {"wu","jia","jun"};//二维数组保存n个字符串 
bool cmp(int a,int b){
    return strcmp(name[a],name[b]) < 0;
}

int main(){
    int arr[3] = {0,1,2};//与字符串数组下标一一对应 
    sort(arr,arr+3,cmp);//排列的实际是标号 ，这么做更快 
    for(int i = 0;i <3 ;i++){
        printf("%s ",name[arr[i]]);
    }
}