找朋友(C++)

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<int> height(N,0);
    for(int i = 0; i < N;i++){
        cin >> height[i];
    }
    //寻找好朋友位置
    vector<int> friends(N,0);
    for(int i = 0;i < N;i++){
        for(int j = i+1;j<N;j++){
            if(height[j]>height[i]){
                friends[i] = j;
                break;
            }
        }
    }
    for(int i = 0; i < N; i++){
        cout << friends[i];
        if(i<N-1){
            cout << ' ';
        }
    }
    cout << endl;
    return 0;
}