$Ac$ $Code$：

#include <bits/stdc++.h>
using namespace std;
struct student
{
    int id, x, y;
}a[1005];
int n;
bool cmp(student x, student y)
{
    if (x.x != y.x)
        return x.x < y.x;
    if (x.y != y.y)
        return x.y < y.y;
    return x.id < y.id;
}
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].x >> a[i].y;
        a[i].id = i;
    }
    sort(a + 1, a + n + 1, cmp);
    for (int i = 1; i <= n; i++)
        cout << a[i].id << " ";
    return 0;
}

yasuo👀️

#include <iostream>
#include <algorithm>
struct stu{short id,y,s;}stud[1005];
short yasuo(stu a,stu b){
    if(a.y!=b.y)return a.y<b.y;
    if(a.s!=b.s)return a.s<b.s;
    return a.id<b.id;}
int main(){
    short n,a[3],sum; std::cin>>n;
    for(int i=1;i<=n;i++){
        std::cin>>a[0]>>a[1]; stud[i]={i,a[0],a[1]};}
    std::sort(stud+1,stud+n+1,yasuo);
    for(int i=1;i<=n;i++)std::cout<<stud[i].id<<" "; return 0;}