赛马
2024-02-15 16:56:14
发布于：浙江
9阅读
0回复
0点赞
#include<bits/stdc++.h>
using namespace std;
bool cmp(int x,int y){
return x>y;
}
int main(){
int n,a[1001] = {0},b[1001] = {0},sum = 0;
bool vis[1001] = {0};
cin>>n;
for(int i = 0;i<n;i++){
cin>>a[i];
}
for(int i = 0;i<n;i++){
cin>>b[i];
}
sort(b,b+n,cmp);
for(int i = 0;i<n;i++){
int min = 1000000,idx = 0,flag = 0,min2 = 10000000,idx2 = 0;
for(int j = 0;j<n;j++){
if(a[j]>b[i]&&a[j]<min&&!vis[j]){
min = a[j];
idx = j;
flag = 1;
}
if(a[j]<min2&&!vis[j]){
min2 = a[j];
idx2 = j;
}
}
if(flag){
vis[idx] = 1;
sum+=200;
}
else{
vis[idx2] = 1;
sum-=200;
}
}
cout<<sum;
return 0;
}
这里空空如也
有帮助，赞一个