模拟+二分查找即可
#include<bits/stdc++.h>
#define INF 3e9
typedef int ll;
using namespace std;
void solve()
{
ll n;cin>>n;
ll v1[n+1];
vector<ll>v;
for(ll i=1;i<=n;i++){cin>>v1[i];v.push_back(v1[i]);}
v.push_back(-1000);
sort(v.begin(),v.end());
ll q;cin>>q;
while(q--)
{
ll x;cin>>x;
auto pos=lower_bound(v.begin(),v.end(),v1[x]);
v.erase(pos);
if(v.size()%2==0)
{
//11:6
cout<<fixed<<setprecision(1)<<(double)v[v.size()/2]<<" ";
}
else
{
//12:6
cout<<fixed<<setprecision(1)<<((double)v[v.size()/2+1]+v[v.size()/2])/2<<" ";
}
}
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0);
// ll t;cin>>t;while(t--)
solve();
return 0;
}