도푸리의 생활공방

package com.example.algorithm import java.util.Collections fun main(){ val nSize = readLine()!!.toInt() var n = readLine()!!.split(' ').map{ it.toInt()} val mSize = readLine()!!.toInt() val m = readLine()!!.split(' ').map{ it.toInt()} var isSearch = false n = n.sorted() //n을 정렬 for(f in m){ var low = 0 var high = nSize-1 var mid: Int while (low f){ high = mid-1 }else if(n[mid] == f){ println(1) ..

코딩테스트 2023. 7. 3. 15:51