#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
#define NMAX 100
int MemNow[NMAX];
bool visited[NMAX]; // 每个内存块只访问1次
int main(int argc, char** argv) {
int T;
scanf("%d", &T);
while (T--) {
int N, M;
scanf("%d", &N);
for (int j = 0; j < N; ++j) {
scanf("%d", &MemNow[j]);
visited[j] = false;
}
sort(MemNow, MemNow + N);
scanf("%d", &M);
int MemReq;
for (int k = 0; k < M; ++k) {
scanf("%d", &MemReq);
int l = 0;
for (; l < N; ++l) {
if (MemNow[l] >= MemReq && !visited[l]) {
visited[l] = true;
printf("%d", MemNow[l]);
break;
}
}
if (l == N) printf("NULL");
if (k < M - 1) printf(" ");
else printf("\n");
}
}
return 0;
}
//2
//4
//7 5 10 3
//2
//4 6
//4
//3 5 9 10
//3
//5 12 6
//5 7
//5 NULL 9
310. 内存分配-网研14-计算机二14
最新推荐文章于 2019-03-22 14:49:17 发布