我的代码

#include<bits/stdc++.h>
using namespace std;
int n,s;
struct man{
	int num,fnd,f[1005],sum;
}a[1005];
bool cmp(man x,man y){
	if(x.fnd==y.fnd) return x.num<y.num;
	return x.fnd<y.fnd;
}
bool cmp2(man x,man y){return x.num<y.num;}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		a[i].num=i;
		cin>>a[i].fnd;
		s+=a[i].fnd;
	}
	if(s%2==1)
	{
		cout<<"NO SOLUTION";
		return 0;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++)
		for(int j=n;j>0;j--)
		{
			if(a[i].sum==a[i].fnd) break;
			if(a[j].sum<a[j].fnd)
			{
				a[j].f[++a[j].sum]=a[i].num;
				a[i].f[++a[i].sum]=a[j].num;
			}
		}
	sort(a+1,a+n+1,cmp2);
	bool o=0;
	for(int i=1;i<=n;i++)
	{
		sort(a[i].f+1,a[i].f+a[i].sum+1);
		if(a[i].sum!=a[i].fnd) o=1;
	}
	if(o)
	{
		cout<<"NO SOLUTION";
		return 0;
	}
	cout<<"SOLUTION\n";
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=a[i].sum;j++)
			cout<<a[i].f[j]<<' ';
		cout<<endl;
	}
    return 0;
}