人口数量排行（结构体数组）

 

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

#define MAX_PROVINCES 31
#define MAX_NAME_LENGTH 50

// 定义结构体存储省份和人口数量
typedef struct {
    char name[MAX_NAME_LENGTH];
    double population;
} Province;

// 冒泡排序算法，降序排序
void bubbleSort(Province provinces[], int n) {
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
            if (provinces[j].population < provinces[j + 1].population) {
                // 交换两个省份的信息
                Province temp = provinces[j];
                provinces[j] = provinces[j + 1];
                provinces[j + 1] = temp;
            }
        }
    }
}

// 打印排序后的省份和人口数量
void printProvinces(Province provinces[], int n) {
    for (int i = 0; i < n; i++) {
        printf("%s %lg万人\n", provinces[i].name, provinces[i].population);
    }
}

int main() {
    int n;
    scanf("%d", &n); // 读取省份数量

    Province provinces[MAX_PROVINCES];
    for (int i = 0; i < n; i++) {
        scanf("%s %lf", provinces[i].name, &provinces[i].population);
    }

    bubbleSort(provinces, n); // 进行冒泡排序

    printProvinces(provinces, n); // 打印排序后的结果

    return 0;
}