Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include<stdio.h>#include<vector>#include<map>#include<algorithm>using namespace std;int num[200005],num2[200005];map<int,int> m;vector<int> v[200005];int counterm[200005];int main(){int t;scanf("%d",&t);for(int cases=1;cases<=t;cases++){int n,q;scanf("%d%d",&n,&q);for(int i=1;i<=n;i++){scanf("%d",&num[i]);num2[i]=num[i];}sort(num2+1,num2+n+1);int top=1;m[num2[1]]=top;counterm[top]=num2[1];top++;for(int i=2;i<=n;i++){if(num2[i]!=num2[i-1]){