View Code of Problem 2591

#include<stdio.h>
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<stack>
using namespace std;


int main()
{
	int n;
	while (cin >> n) {
		while(n--){
		string str;
		string pp;
		char pppppp[1000];
		int k = 0;
		int flag = 0;
		cin >> str >> pp;
		for (int i = 0; i < str.size(); i++) {
			for (int y = 0; y < pp.size(); y++) {
				if (str[i] == pp[y]) {
					pppppp[k++] = str[i];
					flag = 1;
					pp.erase(y,1);
					break;
				}
			}

		}
		sort(pppppp, pppppp + k);
		if (flag == 0) {
			cout << "-1" << endl;
		}
		else {
			for (int i = 0; i < k; i++) {
				cout << pppppp[i];
			}
			cout << endl;
		}
	}

	}






	return 0;
}