Negative Prefixes

Negative Prefixes

思路

贪心,将所有能动的位置从大到小排个序就行了.

#include <bits/stdc++.h>
 
using namespace std;
const int maxn=1e2+10;
typedef pair<int,int> pii;
pii a[maxn];
int n;
vector<int>v;
 
int main() {
    
    
    int _;
    scanf("%d", &_);
    while (_--) {
    
    
        v.clear();
        scanf("%d", &n);
        for (int i = 1; i <= n; i++) {
    
    
            scanf("%d", &a[i].first);
        }
        for (int i = 1; i <= n; i++) {
    
    
            scanf("%d", &a[i].second);
            if (a[i].second == 0) {
    
    
                v.push_back(a[i].first);
            }
        }
        sort(v.begin(), v.end(), greater<int>());
        int cur = 0;
        for (int i = 1; i <= n; i++) {
    
    
            if (a[i].second == 1) printf("%d", a[i].first); else printf("%d", v[cur++]);
            if (i == n) puts(""); else printf(" ");
        }
    }
    return 0;
}