题目链接:http://www.patest.cn/contests/pat-b-practise/1038
1038. 统计同成绩学生(20)
时间限制
250 ms
内存限制
65536 kB
代码长度限制
8000 B
判题程序
Standard
作者
CHEN, Yue
本题要求读入N名学生的成绩,将获得某一给定分数的学生人数输出。
输入格式:
输入在第1行给出不超过105的正整数N,即学生总人数。随后1行给出N名学生的百分制整数成绩,中间以空格分隔。最后1行给出要查询的分数个数K(不超过N的正整数),随后是K个分数,中间以空格分隔。
输出格式:
在一行中按查询顺序给出得分等于指定分数的学生人数,中间以空格分隔,但行末不得有多余空格。
输入样例:10 60 75 90 55 75 99 82 90 75 50 3 75 90 88输出样例:
3 2 0
#include <stdio.h>
#define MAX 100000
void Merge(int* data, int* tmp, int left1, int right1, int right2) {
int left2 = right1 + 1;
int i = left1, j = left2, k = left1;
while(i <= right1 && j <= right2)
if(data[i] <= data[j])
tmp[k++] = data[i++];
else
tmp[k++] = data[j++];
while(i <= right1)
tmp[k++] = data[i++];
while(j <= right2)
tmp[k++] = data[j++];
for(k = left1; k <= right2; ++k)
data[k] = tmp[k];
}
void MSort(int* data, int* tmp, int left, int right) {
if(left < right) {
int mid = (left + right) >> 1;
MSort(data, tmp, left, mid);
MSort(data, tmp, mid + 1, right);
Merge(data, tmp, left, mid, right);
}
}
void MergeSort(int* data, int n) {
int tmp[MAX] = {};
MSort(data, tmp, 0, n - 1);
}
int BinarySearch(int* data, int n, int score) {
int left = 0, right = n - 1;
int mid = 0;
while(left <= right) {
mid = (left + right) >> 1;
if(score < data[mid])
right = mid - 1;
else if(score > data[mid])
left = mid + 1;
else
break;
}
int num = 0;
if(data[mid] == score) { //如果能找到同分的,开始左右找同一分数并确定个数;否则返回0个
for(int i = mid; i < n && data[i] == score; ++i)
++num;
for(int i = mid - 1; i >= 0 && data[i] == score; --i)
++num;
}
return num;
}
int main() {
freopen("in", "r", stdin);
int n;
scanf("%d", &n);
int stu[MAX] = {};
for(int i = 0; i < n; ++i)
scanf("%d", &stu[i]);
//先排序后二分查找,否则第四组测试数据会超时
MergeSort(stu, n); //归并排序
int k;
scanf("%d", &k);
int score[MAX] = {};
for(int i = 0; i < k; ++i)
scanf("%d", &score[i]);
int num[MAX] = {};
for(int i = 0; i < k; ++i)
num[i] = BinarySearch(stu, n, score[i]); //二分查找,函数返回同一分数的人的个数
for(int i = 0; i < k; ++i) {
if(i)
printf(" ");
printf("%d", num[i]);
}
return 0;
}