1228 SWExpert 암호문1

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
 
public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int testcase = 10;
        for(int tc = 1; tc <= testcase; tc++) {
            LinkedList <Integer> list = new LinkedList<>();
            int N = sc.nextInt();
            int a = 0;
            int index = 0;
            int num = 0;
            int num2 = 0;
            int sut = 0;
            for(int i = 0; i < N; i++) {
                a = sc.nextInt();
                list.add(a);
            }
            N = sc.nextInt();
            for(int j = 0; j < N; j++) {
                String c = sc.next();
                if(c.charAt(0) == 'I') {
                    index = sc.nextInt();
                    num = sc.nextInt();
                    num2 = index;
                    for(int i = 0; i < num; i++) {
                        sut = sc.nextInt();
                        list.add(num2++, sut);
                    }
                }
            }
            System.out.print("#" + tc + " ");
            for(int i = 0; i < 10; i++)
                System.out.print(list.get(i) + " ");
            System.out.println();
        }
    }
}
 

LinkedList 로 풀면 쉬운문제