coding-problems/problems/kattis/synchronizinglists/sol.cpp at master · NicoKNL/coding-problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    bool first = true;
    while (true)
    {
        cin >> n;
        if (n == 0)
            break;

        if (!first)
            cout << endl;

        first = false;

        vector<int> A(n, 0);
        vector<int> B(n, 0);

        for (int i = 0; i < n; ++i)
            cin >> A[i];

        for (int i = 0; i < n; ++i)
            cin >> B[i];

        vector<int> ref(A);

        sort(A.begin(), A.end());
        sort(B.begin(), B.end());

        map<int, int> M;

        for (int i = 0; i < n; ++i)
        {
            M[A[i]] = B[i];
        }

        for (int i = 0; i < n; ++i)
        {
            cout << M[ref[i]] << endl;
        }
    }

    return 0;
}