P8939 [SSOI 2023 easy Round] B. 去年 11 月卵梦蕾简易钨丝
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n=scan.nextInt();
int q=scan.nextInt();
ArrayList<Long> list=new ArrayList<>();
for (int i=0;i<n;i++){
long x=scan.nextLong();
list.add(x);
}
while (q-->0){
long opt=scan.nextLong();
long x=scan.nextLong();
if(opt==1){
if(!list.contains(x)){
System.out.println("-1");
continue;
}
list.remove(x);
}
if(opt==2) {
list.add(x);
}
Collections.sort(list);
long min=list.get(0);
long max=list.get(list.size()-1);
System.out.println((max-min)*2);
}
scan.close();
}
}