题解

#include<iostream>
#include<algorithm>
using namespace std;
struct BKI{
    double kg;
    double m;
    double BMI;
    int id;
}a[10000];
bool cmp(BKI x , BKI y){
    return x.BMI > y.BMI;
}
int main(){
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++){
        cin >> a[i].kg;
        a[i].id = i;
    }
    for(int i = 1;i <= n;i++){
        cin >> a[i].m;
        a[i].BMI = a[i].kg / a[i].m / a[i].m;
    }
    sort(a + 1,a + n + 1,cmp);
    for(int i = 1;i <= n;i++){
       cout << a[i].id << " "; 
    }
    return 0;
}