/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Accepted 20ms 696.0 KiB
#3 Accepted 26ms 912.0 KiB
#4 Accepted 25ms 796.0 KiB
#5 Accepted 78ms 7.074 MiB
#6 Accepted 82ms 7.004 MiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, q, ans = 0;
    string s1, s2;
    cin >> n;
    set<pair<ll, ll>> st;
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        st.insert({x, i + 1});
    }
    cin >> q;
    while(q--) {
        ll x; cin >> x;
        ll pos = st.begin()->S;
        cout << pos << endl;
        st.erase(st.begin());
        st.insert({x, pos});
    }
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

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:44:33
Judged At
2024-11-11 03:17:41
Judged By
Score
100
Total Time
82ms
Peak Memory
7.074 MiB