c++++++++++++++++++++++++

解题思路:

注意事项:

参考代码:

#include<iostream>

#include<algorithm>

using namespace std;

struct node {

char f;

char c;

int a;

int b;

}pai[100];

bool cmp(node pai1, node pai2)

{

if (pai1.a != pai2.f)return pai1.a < pai2.a;

else return pai1.b < pai2.b;

}

int main()

{

for (int i = 0; i < 5; i++)

{

cin >> pai[i].f >> pai[i].c;

if (pai[i].f != 'A'||pai[i].f>=50&&pai[i].f<=58) {

pai[i].a = pai[i].f;

if (pai[i].c == 'd')pai[i].b = 100;

if (pai[i].c == 'c')pai[i].b = 101;

if (pai[i].c == 'h')pai[i].b = 102;

if (pai[i].c == 's')pai[i].b = 103;

}

else

{

pai[i].a = 99;//A=99

if (pai[i].c == 'd')pai[i].b = 100;

if (pai[i].c == 'c')pai[i].b = 101;

if (pai[i].c == 'h')pai[i].b = 102;

if (pai[i].c == 's')pai[i].b = 103;

}

}

sort(pai, pai + 5, cmp);

for (int i = 0; i < 5; i++)

cout << pai[i].f << pai[i].c << " ";

return 0;

}