多条件排序

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

struct student{
    int index;
    int height;
    int weight;
    student(int i,int h,int w):index(i),height(h),weight(w){}
};

bool compare(student &a,student &b){
    if (a.height != b.height) return a.height < b.height;
    else if (a.weight != b.weight) return a.weight < b.weight;
    else return a.index < b.index;
}

int main(){
    int n;
    while (cin>>n){
        vector<int> height(n+1,0);
        vector<int> weight(n+1,0);
        vector<student> sv;
        for (int i = 1; i <= n; ++i) {
            cin>>height[i];
        }
        for (int i = 1; i <= n; ++i) {
            cin>>weight[i];
        }
        for (int i = 1; i <= n; ++i) {
            sv.emplace_back(i,height[i],weight[i]);
        }
        sort(sv.begin(), sv.end(),compare);
        for (auto s:sv) {
            cout<<s.index;
        }
        cout<<endl;
    }
    return 0;
}