mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-24 02:48:48 +00:00
P3156 【深基15.例1】询问学号
R38858817
This commit is contained in:
parent
fbe2b155c3
commit
9808796487
18
problem/P3156/P3156.cpp
Normal file
18
problem/P3156/P3156.cpp
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
// R38858817
|
||||||
|
|
||||||
|
#include <bits/stdc++.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
int n, m, a[10000005], q;
|
||||||
|
cin >> n >> m;
|
||||||
|
for (int i = 0; i < n; i++) {
|
||||||
|
cin >> a[i];
|
||||||
|
}
|
||||||
|
for (int i = 0; i < m; i++) {
|
||||||
|
cin >> q;
|
||||||
|
cout << a[q-1] << endl;
|
||||||
|
}
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user