C语言
2025-07-04 14:34:52
发布于:浙江
1阅读
0回复
0点赞
#include <stdio.h>
#include <stdlib.h>
int compare(const void *a, const void *b) {
return (*(int*)b - *(int*)a);
}
int main() {
int n;
scanf("%d", &n);
int a[100], b[100];
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d", &b[i]);
}
qsort(a, n, sizeof(int), compare);
qsort(b, n, sizeof(int), compare);
int left_a = 0, right_a = n - 1;
int left_b = 0, right_b = n - 1;
int win = 0, tie = 0, lose = 0;
while (left_a <= right_a) {
if (a[left_a] > b[left_b]) {
win++;
left_a++;
left_b++;
} else if (a[left_a] < b[left_b]) {
lose++;
right_a--;
left_b++;
} else {
if (a[right_a] > b[right_b]) {
win++;
right_a--;
right_b--;
} else {
if (a[right_a] < b[left_b]) {
lose++;
} else if (a[right_a] == b[left_b]) {
tie++;
}
right_a--;
left_b++;
}
}
}
printf("%d\n", (win - lose) * 200);
return 0;
}
这里空空如也
有帮助,赞一个