/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 65ms 5.238 MiB
#3 Accepted 77ms 5.57 MiB
#4 Accepted 74ms 5.453 MiB
#5 Accepted 106ms 10.98 MiB
#6 Accepted 110ms 10.867 MiB

Code

/*
**************************************************************
*Bis'Millah Hir Rah'Manir Rahim == start with the name of \n *
*                    ALLAH Subhana Tayala                    *
*                Author: Md. Mahabubar Rahman                *
*               CSE,RPI && Rangpur, Bangladesh               *
**************************************************************
*/
#include <bits/stdc++.h>
using namespace std;
#define Allhamdulillah 0
#define pb(x) push_back(x)
#define pp() pop_back()
#define ll long long int
#define foi(i, s, e) for (int i = s; i < e; i++)
#define cn(x) cin >> x
#define endl '\n'
#define Endl '\n'
#define nl cout << '\n'
#define yes cout << "YES\n"
#define no cout << "NO\n"

void solve()
{
    int n;cin>>n;int arr[n];for(auto &c:arr)cin>>c;
    priority_queue<int,vector<int>,greater<int>>pq;
    for(auto &c:arr)pq.push(c);
    int q;cin>>q;
    map<int,int>mp;
    for(int i=0;i<n;i++)mp[arr[i]]=i+1;
    while(q--){
        int x;cin>>x;
        cout<<mp[pq.top()]<<endl;
        mp[x]=mp[pq.top()];
        pq.pop();pq.push(x);
    }
}
/*mdmahabub55*/
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int t = 1;
    // cin >> t;
    // t = 1;

    while (t--)
    {
        solve();
    }
    return Allhamdulillah;
}

Information

Submit By
Type
Submission
Problem
P1086 KuZ the Position
Contest
Bangladesh 2.0
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 15:40:27
Judged At
2024-11-11 03:18:06
Judged By
Score
100
Total Time
110ms
Peak Memory
10.98 MiB