求助今天普及组T2

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=1000+10;
const int MAXM=100000+10;
const int INF=100000;
struct node{
	ll id,v;
}a[MAXM];
int pd(int x,int y)
{
	ll u=0,v=0,a[10],b[10];
	memset(a,0,sizeof a);
	memset(b,0,sizeof b);
	while(x>0)
	{
		a[u]=x%10;
		x/=10;
		u++;
	}
	while(y>0)
	{
		b[v]=y%10;
		y/=10;
		v++;
	}
	int i=u-1,j=v-1;
	while(i>=0&&j>=0){
		if(b[j]<a[i]) return 0;
		if(b[j]>a[i]) return 1;
		i--;j--;
	}
	if(u>v) return 0;
	if(u<v) return 1;
	return 2;
}
bool cmp(node x,node y)
{
    if(pd(x.v,y.v)==2) return x.id<y.id;
    else return pd(x.v,y.v);
}
int main()
{
	ll n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	 {
	 	cin>>a[i].v;
	 	a[i].id=i;
	 }
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=n;i++)
	 {
	 	cout<<a[i].id<<" ";
	 }
	return 0;
}