思路:
纯模拟模拟加排序
C o d e Code Code:
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int n,q,len,need;
int a[1001],mod[9] = {0,10,100,1000,10000,100000,1000000,10000000,100000000};
int check ()
{
for (int i = 1; i <= n; ++i)
if(a[i]%mod[len] == need) return a[i];//编码最小的那本书的图书编码
return -1;
}
int main()
{
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; ++i)scanf("%d",&a[i]);
sort (a + 1, a + 1 + n);//排序
for (int i = 1; i <= q; ++i)
{
scanf("%d%d", &len,&need);
printf("%d\n",check());
}
return 0;
}