#include<iostream>
#include<cmath>
using namespace std;
int n,m,book[6666],len[6666],num[6666];
#define int long long
signed main() {
cin>>n>>m;
for(int i=1; i<=n; i++) {
cin>>book[i];
}
for(int i=1; i<=m; i++) {
cin>>len[i]>>num[i];
int tmp = pow(10,len[i]),min = 10000001;
for(int j=1; j<=n; j++) {
if(book[j] % tmp == num[i] && book[j] < min) {
min = book[j];
}
}
if(min != 10000001) {
cout<<min<<endl;
} else {
cout<<-1<<endl;
}
}
return 0;
}
洛谷P3955 [NOIP2017 普及组] 图书管理员题解
最新推荐文章于 2024-10-04 17:07:53 发布