/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 9ms 9.52 MiB
#2 Accepted 211ms 9.879 MiB
#3 Accepted 214ms 10.023 MiB
#4 Accepted 215ms 10.113 MiB
#5 Accepted 290ms 16.246 MiB
#6 Accepted 318ms 16.172 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define int long long

const int N = 3e5 + 9;
const int inf = 3e10 + 9;

int a[N], b[N];
int dp[1003][103];

string s[N];

vector<int> v[7];

std::map<string, int> mp;

int32_t main() {

    int tc = 1;
    // cin >> tc;
    while(tc--) {
        int n; cin >> n;
        set<pair<int,int> > st;
        for (int i = 0; i < n; ++i)
        {
            int x; cin >> x;
            st.insert({x, i + 1});
        }

        int q; cin >> q;
        while(q--)
        {
            int val; cin >> val;
            auto v = *st.begin();

            st.erase(v);

            st.insert({val, v.second});
            cout << v.second << endl;
        }
    }

    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:51:23
Judged At
2024-08-16 15:51:23
Judged By
Score
100
Total Time
318ms
Peak Memory
16.246 MiB