UVA

主要学习一下怎么利用sort对二维字符数组排序

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

const int maxn = 3e5 + 10;
char s[maxn][50];
char *str[maxn];

//
bool cmp(const char *s1, const char *s2) {
    return strcmp(s1, s2) < 0;
}

int main(int argc, const char * argv[]) {
    int cnt = 0, p = 0;
    char c;
    while ((c = getchar()) != EOF) {
        //if (c == '#') break;
        if ('A' <= c && c <= 'Z') {
            c = c - 'A' + 'a';
            s[cnt][p++] = c;
        } else if ('a' <= c && c <= 'z') {
            s[cnt][p++] = c;
        } else {
            if (p != 0) {
                s[cnt][p] = '';
                str[cnt] = s[cnt];
                cnt++;
                p = 0;
            }
        }
    }
    sort(str, str + cnt, cmp);//
    puts(str[0]);
    for (int i = 1; i < cnt; i++) {
        if (strcmp(str[i], str[i - 1]) != 0) {
            puts(str[i]);
        }
    }
    return 0;
}

或者就写成结构体，就转化为对结构体进行排序