题解 | #[NOIP2017]图书管理员#

#include <stdio.h> #include <limits.h>

int main() { int n, q; scanf("%d%d", &n, &q); int a[n]; int i; for (i = 0; i < n; i++) { scanf("%d", &a[i]); }

while (q--) {
    int c, b;
    scanf("%d%d", &c, &b);
    
    int chu = 1;
    int i ;
    for (i = 0; i < c; i++) {
        chu *= 10; 
    }

    int min = INT_MAX;
    int m = -1; 
    int j=0;
    for (j = 0; j < n; j++) {
        int fa = a[j] - b;
        if (fa >= 0 && fa % chu == 0) {
            if (fa / chu < min) {
                min = fa / chu;
                m = j; 
            }
        }
    }

    if (m != -1) {
        printf("%d\n", a[m]); 
    } else {
        printf("-1\n"); 
    }
}

return 0;

}