大佬求救,样例过不去!!!
查看原帖
大佬求救,样例过不去!!!
1063799
chenshenqi楼主2024/3/9 18:25
#include <bits/stdc++.h>
using namespace std;
struct node{
    int r;
    int s;
    int rs;
    int ss;
    int zs;
    int id;
}a[100005];
bool cmp(node a,node b){
    return a.s>b.s;
}
bool cmp1(node a,node b){
	if (a.zs!=b.zs){
		return a.zs>b.zs;
	}
	return a.s>b.s;
}
int main() {
    int n;
    cin >> n;
    for (int i=1; i<=n; i++){
        cin >> a[i].r;
        a[i].id=i;
        a[i].rs=n-i+1;
        a[i].zs+=a[i].rs;
    }
    for (int i=0; i<n; i++){
	    cin >> a[i].s;
	}
    sort(a+1,a+n+1,cmp);
    for (int i=1; i<=n; i++){
   	    a[i].ss=n-i+1;
   	    a[i].zs+=a[i].ss;
   	} 
   	sort(a+1,a+n+1,cmp1);
   	for (int i=1; i<=n; i++){
	   	cout << i << ". " << "Kod" << (a[i].id<10?" 0":" ") << a[i].id << "(" << a[i].zs << ")" << endl;
	}
    return 0;
}


麻烦各位大佬看看哪里错了,感激不禁!!!

2024/3/9 18:25
加载中...