偶的代码...
```cpp
#include <bits/stdc++.h>
using namespace std;
int n, q, len[2001];
string s[2001], r[2001];
bool cmp(string s1, string s2)
{
if (s1.length() < s2.length()) return s1.length() < s2.length();
else return s1 < s2;
}
bool mate(string s1, string s2, int m)
{
// cout << "s1.len:" << s1.length() << ',' << "m:" << m << endl;
if (s1.length() < m) return false;
string connect = s1.substr(s1.length() - m, m);
if (connect == s2) return true;
else return false;
}
int main ()
{
freopen("1.in", "r", stdin);
freopen("1.out", "w", stdout);
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) cin >> s[i];
sort(s + 1, s + n + 1, cmp);
for (int i = 1; i <= q; i++)
{
bool findtrue = false;
cin >> len[i] >> r[i];
for (int j = 1; j <= n; j++)
if (mate(s[j], r[i], len[i]))
{
cout << s[j] << endl;
findtrue = true;
break;
}
if (findtrue == false) printf("-1\n");
}
return 0;
}
```
by pengzhaozhao @ 2020-05-26 22:58:17
是啊是啊 一定是评测机出问题了
by Rainy_chen @ 2020-05-27 06:28:40
是啊是啊 一定是评测机出问题了
by Flandre_495 @ 2020-05-27 06:29:59
是啊是啊 一定是评测机出问题了
by DeepSkyBlue__ @ 2020-05-27 06:33:20
WA，一定是评测姬出问题了
TLE，一定是评测姬太慢了
RE，一定是评测姬坏了
样例没过，一定是样例也出问题了
这题就当过了吧
~~滑稽保命~~
by Ryo_Yamada @ 2020-05-27 06:53:37
你代码错了
by _扬子江_ @ 2020-05-27 06:56:19
~~WA，一定是评测姬出问题了~~
~~TLE，一定是评测姬太慢了~~
~~RE，一定是评测姬坏了~~
~~样例没过，一定是样例也出问题了~~
~~这题就当过了吧~~
by lndjy @ 2020-05-27 06:58:23
~~WA，一定是评测姬出问题了~~
~~TLE，一定是评测姬太慢了~~
~~RE，一定是评测姬坏了~~
~~样例没过，一定是样例也出问题了~~
~~这题就当过了吧~~
by brimosta @ 2020-05-27 07:16:40
是啊是啊 一定是评测机出问题了
by 一只书虫仔 @ 2020-05-27 07:30:28
谔谔
by VTloBong @ 2020-05-27 07:45:32