学步园

http://acm.hdu.edu.cn/showproblem.php?pid=2550

//水题
#include <iostream>
#include <algorithm>
using namespace std;

struct Arr {
 int a;
 int b;
};

int cmp (const Arr a, const Arr b)
{
 return a.a < b.a;
}

int main()
{
 int t, N;
 Arr arr[50];
 int i, j, k;
 cin >> t;
 while (t--) {
  cin >> N;
  for (i = 0; i < N; i++)
   cin >> arr[i].a >> arr[i].b;
  sort(arr, arr + N, cmp);
  for (i = 0; i < N; i++) {
   for (j = 0; j < arr[i].b; j++) {
    cout << ">+";
    for (k = 2; k < arr[i].a; k++)
     cout << "-";
    cout << "+>" << endl;
   }
   cout << endl;
  }
 } 
 return 0;
}