int score; }student; int main() { student stu[5000] = { 0 }; student tmp; int n = 0; int m = 0; int i = 0; int j = 0; scanf("%d %d", &n, &m); for (i = 0;i < n;i++) { scanf("%d %d", &stu[i].num, &stu[i].score); } for (i = 0;i < n - 1;...
解题思路:floor函数向下取整得出计划志愿者数,根据取整结果得出分数线;注意事项:假如,按第三个志愿者的分数(已排序)划定分数线,但他后面还有与其分数相同的人,则面试人数应该以分数上线人数为准; 参考代码: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 ...