xiongshuxian2019的博客

You are given an array a consisting of n integers (it is guaranteed that n is even, i.e. divisible by 2). All ai does not exceed some integer k.Your task is to replace the minimum number of elements (replacement is the following operation: choose some ind

debug 到怀疑人生…坑点：给的是时间， 用时越长 马越弱#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <map>using namespace std;int a[100006], b[100006]...