2892. 文件排序

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct {char date[11]; char time[6]; int size; char name[70];}File;
int cmptime(const void*a, const void*b)
{
    File *p1=(File*)a, *p2=(File*)b;
    if(!strcmp(p1->date, p2->date))
    {
        if(!strcmp(p1->time, p2->time))
            return strcmp(p1->name, p2->name);
        return strcmp(p1->time, p2->time);
    }
    return strcmp(p1->date, p2->date);
}
int cmpname(const void*a, const void*b)
{
    File *p1=(File*)a, *p2=(File*)b;
    return strcmp(p1->name, p2->name);
}
int cmpsize(const void*a, const void*b)
{
    File *p1=(File*)a, *p2=(File*)b;
    if(p1->size==p2->size) return strcmp(p1->name, p2->name);
    return p1->size-p2->size;
}
int main()
{
    int n;
    char command[6], list[5];
    scanf("%d",&n);
    while(n)
    {
        File file[100];
        int i;
        for(i=0; i<n; i++)
            scanf("%s %s %d %s",file[i].date, file[i].time, &file[i].size, file[i].name);
        scanf("%s %s",list,command);
        if(!strcmp(command, "/NAME"))
            qsort(file, n, sizeof(file[0]), cmpname);
        else if(!strcmp(command, "/SIZE"))
            qsort(file, n, sizeof(file[0]), cmpsize);
        else
            qsort(file, n, sizeof(file[0]), cmptime);
        for(i=0; i<n; i++)
            printf("%s %s %16d %s\n",file[i].date, file[i].time, file[i].size, file[i].name);
        printf("\n");
        if(!scanf("%d",&n)) break;
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int n;
string s1="LIST /NAME", s2="LIST /SIZE", s3="LIST /TIME";
struct data
{
    string Date, Time;
    int Size;
    string Name;
}d[200];

bool cmp1(data x, data y)
{
    return x.Name<y.Name;
}
void nameSort()
{
    sort(d,d+n,cmp1);
}

bool cmp2(data x, data y)
{
    if(x.Size==y.Size) return x.Name<y.Name;
    return x.Size<y.Size;
}
void sizeSort()
{
    sort(d,d+n,cmp2);
}

bool cmp3(data x, data y)
{
    if(x.Date==y.Date&&x.Time==y.Time) return x.Name<y.Name;
    if(x.Date==y.Date) return x.Time<y.Time;
    return x.Date<y.Date;
}
void timeSort()
{
    sort(d,d+n,cmp3);
}
int main()
{
    while(cin>>n&&n!=0){
        for(int i=0;i<n;++i)
            cin>>d[i].Date>>d[i].Time>>d[i].Size>>d[i].Name;
        char ch=getchar();//读掉第一行的回车
        //string now;
        //getline(cin,now);
        string now1, now2;
        cin>>now1>>now2;
        string now=now1+' '+now2;

        if(now==s1) nameSort();
        else if(now==s2) sizeSort();
        else if(now==s3) timeSort();

        for(int i=0;i<n;++i)
            cout<<d[i].Date<<' '<<d[i].Time<<setw(17)<<d[i].Size<<' '<<d[i].Name<<endl;
        puts("");
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
struct node{
    string date,time,name;
    int size;
}arr[maxn];

bool cmp1(const node& a,const node& b){
    return a.name<b.name;
}
bool cmp2(const node& a,const node& b){
    return a.size<b.size;
}
bool cmp3(const node& a,const node& b){
    if (a.date == b.date){
        if(a.time == b.time) return a.name<b.name;
        return a.time<b.time;
    }
    return a.date<b.date;
}

int main() {
    int n;
    while (cin>>n,n){
        for (int i = 0; i < n; ++i) {
            cin>>arr[i].date>>arr[i].time>>arr[i].size>>arr[i].name;
        }
        string order;
        cin>>order;
        cin>>order;
        order = order.substr(1,4);
        if (order == "NAME"){
            sort(arr,arr+n,cmp1);
        } else if (order == "SIZE"){
            sort(arr,arr+n,cmp2);
        }else{
            sort(arr,arr+n,cmp3);
        }
        for (int j = 0; j < n; ++j) {
            printf("%s %s %16d %s\n",arr[j].date.c_str(),arr[j].time.c_str(),arr[j].size,arr[j].name.c_str());
        }
        printf("\n");
    }
    return 0;
}

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

typedef struct {
    char name[64];
    char date[11];
    char time[6];
    unsigned size;
} FileMeta;

#define N 100

FileMeta files[N];

int cmp_name(FileMeta const* a, FileMeta const* b) {
    return strcmp(a->name, b->name);
}

int cmp_size(FileMeta const* a, FileMeta const* b) {
    if (a->size != b->size) {
        return a->size < b->size ? -1 : 1;
    }
    return strcmp(a->name, b->name);
}

int cmp_time(FileMeta const* a, FileMeta const* b) {
    int ret = strcmp(a->date, b->date);
    if (ret != 0) { return ret; }

    ret = strcmp(a->time, b->time);
    if (ret != 0) { return ret; }

    return strcmp(a->name, b->name);
}

int main() {
    for (;;) {
        unsigned n;
        scanf("%u", &n);
        if (n == 0) break;

        for (unsigned i = 0; i != n; ++i) {
            scanf("%s%s%u%s", files[i].date, files[i].time, &files[i].size, files[i].name);
        }

        char cmd[8];
        scanf("%s", cmd);
        scanf("%s", cmd);

        if (strcmp(cmd, "/NAME") == 0) {
            qsort(files, n, sizeof *files, cmp_name);
        } else if (strcmp(cmd, "/SIZE") == 0) {
            qsort(files, n, sizeof *files, cmp_size);
        } else {
            qsort(files, n, sizeof *files, cmp_time);
        }

        for (unsigned i = 0; i != n; ++i) {
            printf("%s %s %16u %s\n", files[i].date, files[i].time, files[i].size, files[i].name);
        }
        putchar('\n');
    }
}