oli2004judclasa7

#include<iostream>
#include<algorithm>
#include<fstream>
using namespace std;
ifstream fin("siruri.in");
ofstream fout("siruri.out");
int x[105];
pair <int, int> y[105];
int main()
{
    int i, j, n, l=1;
    fin>>n;
    for(i=1; i<=n; i++)
    {
        fin>>x[i];
    }
    sort(x+1, x+n+1);
    for(i=n; i>=1; i--)
    {
       y[i].first=x[i];
       y[i].second=i;
    }
    fin.close();
    fin.open("siruri.in", ios::in);
    fin>>n;
    for(i=1; i<=n; i++)
    {
        fin>>x[i];
        l=1;
        while(100>2)
        {
            if(x[i]==y[l].first)
            {
                fout<<y[l].second<<' ';
                break;
            }
            else
            {
                l++;
            }
        }
    }
    fin.close();
    fout.close();
    return 0;
}