二つの入口の入場記録をまとめる

n, m = map(int, input().split())a = list(map(int, input().split()))b = list(map(int, input().split())) pos_a, pos_b = [], []i = j = 0place = 1while i < n or j < m:    # A를 고르는 때: B가 다 끝났거나, A의 시각이 B보다 이르거나 같을 때(같으면 A가 먼저)    if j == m or (i < n and a[i] <= b[j]):        pos_a.append(place)        i += 1    else:        pos_b.append(place)        j += 1    place += 1print(*pos_a)print(*pos_b)

const lines = require("fs").readFileSync(0, "utf8").split("\n");const [n, m] = lines[0].trim().split(/\s+/).map(Number);const a = lines[1].trim().split(/\s+/).map(Number);const b = lines[2].trim().split(/\s+/).map(Number);const posA = [], posB = [];let i = 0, j = 0;for (let place = 1; place <= n + m; place++) {  // B가 끝났거나 A가 이르거나 같으면 A가 먼저  if (j === m || (i < n && a[i] <= b[j])) {    posA.push(place);    i++;  } else {    posB.push(place);    j++;  }}console.log(posA.join(" ") + "\n" + posB.join(" "));

import { readFileSync } from "node:fs";const lines: string[] = readFileSync(0, "utf8").split("\n");const [n, m] = lines[0].trim().split(/\s+/).map(Number);const a: number[] = lines[1].trim().split(/\s+/).map(Number);const b: number[] = lines[2].trim().split(/\s+/).map(Number);const posA: number[] = [], posB: number[] = [];let i = 0, j = 0;for (let place = 1; place <= n + m; place++) {  if (j === m || (i < n && a[i] <= b[j])) {    posA.push(place);    i++;  } else {    posB.push(place);    j++;  }}console.log(posA.join(" ") + "\n" + posB.join(" "));

import java.io.BufferedReader;import java.io.InputStreamReader;import java.util.StringTokenizer; public class Main {    static int[] readInts(BufferedReader br, int k) throws Exception {        StringTokenizer st = new StringTokenizer(br.readLine());        int[] r = new int[k];        for (int t = 0; t < k; t++) r[t] = Integer.parseInt(st.nextToken());        return r;    }     public static void main(String[] args) throws Exception {        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));        StringTokenizer st = new StringTokenizer(br.readLine());        int n = Integer.parseInt(st.nextToken()), m = Integer.parseInt(st.nextToken());        int[] a = readInts(br, n), b = readInts(br, m);   // int[]라 ==가 값을 비교한다        StringBuilder outA = new StringBuilder(), outB = new StringBuilder();        int i = 0, j = 0;        for (int place = 1; place <= n + m; place++) {            if (j == m || (i < n && a[i] <= b[j])) {                if (outA.length() > 0) outA.append(' ');                outA.append(place);                i++;            } else {                if (outB.length() > 0) outB.append(' ');                outB.append(place);                j++;            }        }        System.out.print(outA + "\n" + outB + "\n");    }}

using System;using System.Collections.Generic; class Program{    static void Main()    {        string[] first = Console.ReadLine().Split(' ', StringSplitOptions.RemoveEmptyEntries);        int n = int.Parse(first[0]), m = int.Parse(first[1]);        int[] a = Array.ConvertAll(Console.ReadLine().Split(' ', StringSplitOptions.RemoveEmptyEntries), int.Parse);        int[] b = Array.ConvertAll(Console.ReadLine().Split(' ', StringSplitOptions.RemoveEmptyEntries), int.Parse);        var posA = new List<int>(n);        var posB = new List<int>(m);        int i = 0, j = 0;        for (int place = 1; place <= n + m; place++)        {            if (j == m || (i < n && a[i] <= b[j]))            {                posA.Add(place);                i++;            }            else            {                posB.Add(place);                j++;            }        }        Console.WriteLine(string.Join(" ", posA));        Console.WriteLine(string.Join(" ", posB));    }}

#include <iostream>#include <vector> void printLine(const std::vector<int>& p) {    for (size_t t = 0; t < p.size(); t++) std::cout << (t ? " " : "") << p[t];    std::cout << "\n";} int main() {    std::ios::sync_with_stdio(false);    std::cin.tie(nullptr);    int n, m;    std::cin >> n >> m;    std::vector<int> a(n), b(m);    for (int& x : a) std::cin >> x;    for (int& x : b) std::cin >> x;    std::vector<int> posA, posB;    int i = 0, j = 0;    for (int place = 1; place <= n + m; place++) {        if (j == m || (i < n && a[i] <= b[j])) {            posA.push_back(place);            i++;        } else {            posB.push_back(place);            j++;        }    }    printLine(posA);    printLine(posB);}

#include <stdio.h> static int a[10000], b[10000];static int pos_a[10000], pos_b[10000]; static void print_line(const int *p, int k) {    for (int t = 0; t < k; t++) printf(t ? " %d" : "%d", p[t]);    printf("\n");} int main(void) {    int n, m;    scanf("%d %d", &n, &m);    for (int t = 0; t < n; t++) scanf("%d", &a[t]);    for (int t = 0; t < m; t++) scanf("%d", &b[t]);    int i = 0, j = 0;    for (int place = 1; place <= n + m; place++) {        /* B가 끝났거나 A가 이르거나 같으면 A가 먼저 */        if (j == m || (i < n && a[i] <= b[j])) {            pos_a[i++] = place;        } else {            pos_b[j++] = place;        }    }    print_line(pos_a, n);    print_line(pos_b, m);    return 0;}

first = コンソール.数読み();n = first[0];m = first[1];a = コンソール.数読み();b = コンソール.数読み();posA = [];posB = [];i = 0;j = 0;繰り返す (place = 1; place <= n + m; place++){    // B가 끝났거나, A가 남아 있고 A의 시각이 이르거나 같으면 A가 먼저    // &&는 앞이 거짓이면 뒤를 보지 않으니 i < n을 먼저 묻는다    takeA = j == m || i < n && a[i] <= b[j];    もし (takeA)    {        posA.追加(place);        i++;    }    でなければ    {        posB.追加(place);        j++;    }}コンソール.書く(posA);コンソール.書く(posB);