1
#include <stdio.h>
2
#include <stdlib.h>
3
#include <string.h>
4

5
struct Person {
6
    int id;
7
    char name[30];  // 实际上是 "Lastname Firstname"
8
    double income;
9
};
10

11
// 你需要完成的函数
12
double SumIncomeByLastname(struct Person *people, int n, const char *lastname);
13
double SumIncomeByIDList(struct Person *people, int n, int *id_list, int id_count);
14

15
// 用于测试
16
void Test(struct Person *people, int n);
17

18
int main(void) {
19
    int n;
20
    scanf("%d", &n);
21
    getchar(); // 清除换行符
22

23
    struct Person *people = (struct Person *)malloc(n * sizeof(struct Person));
24
    for (int i = 0; i < n; i++) {
25
        // 读取一行
26
        char line[100];
27
        if (!fgets(line, sizeof(line), stdin))
28
            break;
29

30
        // 解析行并存入结构体的相应数据中
31
        int id;
32
        char lastname[20], firstname[20];
33
        double income;
34

35
        sscanf(line, "%d %s %s %lf", &id, lastname, firstname, &income);
36

37
        people[i].id = id;
38
        people[i].income = income;
39
        snprintf(people[i].name, sizeof(people[i].name),"%s %s", lastname, firstname);
40

41
    }
42

43
    Test(people, n);
44
    free(people);
45
    return 0;
46
}
47

48
void Test(struct Person *people, int n) {
49
    // 0. 测试输出全部信息
50
    for(int i = 0; i < n; i++)
51
        printf("%d %s %f\n", people[i].id, people[i].name, people[i].income);
52

53
    // 1. 测试姓氏 "Zhang"
54
    printf("=== 测试: 姓氏 \"Zhang\" ===\n");
55
    printf("%.2f\n", SumIncomeByLastname(people, n, "Zhang"));
56

57
    // 2. 测试姓氏 "Li"
58
    printf("=== 测试: 姓氏 \"Li\" ===\n");
59
    printf("%.2f\n", SumIncomeByLastname(people, n, "Li"));
60

61
    // 3. 测试姓氏 "Torres"（假设存在）
62
    printf("=== 测试: 姓氏 \"Torres\" ===\n");
63
    printf("%.2f\n", SumIncomeByLastname(people, n, "Torres"));
64

65
    // 4. 测试不存在的姓氏 "Minese"
66
    printf("=== 测试: 姓氏 \"Minese\" (不存在) ===\n");
67
    printf("%.2f\n", SumIncomeByLastname(people, n, "Minese"));
68

69
    // 5. 测试完整名 "Zhang San"（不应匹配，因为只比对姓）
70
    printf("=== 测试: 姓氏 \"Zhang San\" (完整名) ===\n");
71
    printf("%.2f\n", SumIncomeByLastname(people, n, "Zhang San"));
72

73
    // 6. 测试 ID 列表：1001 ~ 1100 全部 ID
74
    printf("=== 测试: ID 1001~1100 全部 ===\n");
75
    int all_ids[100];
76
    for (int i = 0; i < 100; i++) {
77
        all_ids[i] = 1001 + i;
78
    }
79
    printf("%.2f\n", SumIncomeByIDList(people, n, all_ids, 100));
80

81
    // 7. 测试 ID 列表：1001~1100 的奇数 ID
82
    printf("=== 测试: ID 1001~1100 奇数 ===\n");
83
    int odd_ids[50];
84
    int count = 0;
85
    for (int i = 1001; i <= 1100; i += 2) {
86
        odd_ids[count++] = i;
87
    }
88
    printf("%.2f\n", SumIncomeByIDList(people, n, odd_ids, count));
89

90
    // 8. 测试 ID 列表：1001~1100 的偶数 ID
91
    printf("=== 测试: ID 1001~1100 偶数 ===\n");
92
    int even_ids[50];
93
    count = 0;
94
    for (int i = 1002; i <= 1100; i += 2) {
95
        even_ids[count++] = i;
96
    }
97
    printf("%.2f\n", SumIncomeByIDList(people, n, even_ids, count));
98
}
99

100
double SumIncomeByLastname(struct Person *people, int n, const char *lastname)
101
{
102
    if (n <= 0) return -1;
103
    if (!people) return -1;
104
    if (!lastname) return -1;
105

106
    double sum = 0.0;
107
    int len = strlen(lastname);
108

109
    for (int i = 0; i < n; i++)
110
    {
111
        if (strncmp(people[i].name, lastname, len) == 0 && people[i].name[len] == ' ')
112
        {
113
            sum += people[i].income;
114
        }
115
    }
116
    return sum;
117
}
118

119

120
double SumIncomeByIDList(struct Person *people, int n, int *id_list, int id_count)
121
{
122
    double sum = 0.0;
123
    if ( people == NULL ) return -1;
124
    if ( n <= 0 ) return -1;
125
    for (int i = 0; i < n; i++)
126
    {
127
        for (int j = 0; j < id_count; j++)
128
        {
129
            if ( people[i].id == id_list[j] )
130
            {
131
                sum += people[i].income;
132
                break;
133
            }
134
        }
135
    }
136
    return sum;
137
}