Codeforces Round #743 (Div. 2) B. Swaps

Posted 2021-10-17 嗯我想想

思路：坐标存储 + 双指针 + 贪心

AC代码

#include <bits/stdc++.h>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
 
typedef pair<int,int> p;
const int N = 1e5 + 10;
 
int b[N];
p a[N];
 
int n, t;
int ans;
 
int main() {
    while(cin >> t) {
        while(t--) {
            ans = INF;
            cin >> n;
            for(int i = 0; i < n; i++)
                cin >> a[i].first, a[i].second = i;
            for(int i = 0; i < n; i++)
                cin >> b[i];
 
            sort(a,a+n);
 
            for(int i = 0, j = 0; i < n; i++) {
                while(a[i].first > b[j])
                    j++;
                ans = min(ans,a[i].second + j);
            }
            cout << ans << endl;
        }
    }
    return 0;
}