Accepted
Code
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
/* int t;
cin >> t;
while (t--){*/
ll n, x, q;
cin >> n;
priority_queue<pair<ll, ll>> pq;
for (int i = 1; i <= n; i++){
cin >> x;
pq.push({-x, i});
}
cin >> q;
while (q--){
cin >> x;
ll f = pq.top().first;
ll s = pq.top().second;
pq.pop();
cout << s << endl;
pq.push({-x, s});
}
//cout << (n + 1) / 2 - 1 << endl;
//}
}
Information
- Submit By
- Type
- Submission
- Problem
- P1086 KuZ the Position
- Contest
- Bangladesh 2.0
- Language
- C++17 (G++ 13.2.0)
- Submit At
- 2024-08-16 15:46:14
- Judged At
- 2024-10-03 13:30:01
- Judged By
- Score
- 100
- Total Time
- 259ms
- Peak Memory
- 2.738 MiB