注意一个问题:他要求按箭的小大顺序排序输出。
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define maxn 100
using namespace std;
int a[maxn];
struct Node{
int x;
int y;
bool operator <(const Node &other) const{
return x<other.x;
}
}node[maxn];
string s;
int main(){
int n,m=0,index;
int sum=0;
int t;
cin>>t;
for(int i=0;i<t;i++){
cin>>n;
for(int j=0;j<n;j++){
cin>>node[j].x>>node[j].y;
}
sort(node,node+n);
for(int j=0;j<n;j++){
for(int k=0;k<node[j].y;k++){
cout<<">+";
for(int mv=0;mv<node[j].x-2;mv++){
cout<<"-";
}
cout<<"+>"<<endl;
}
cout<<endl;
}
}
return 0;
}