← 返回题目

题库练习 Bracket Subsequence

← 上一题下一题 →

A11869 | $Bracket Subsequence$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

The first line contains two integers $n$ and $k$ ( $2 \le k \le n \le 2 \cdot 10^5$ , both $n$ and $k$ are even) — the length of $s$ and the length of the sequence you are asked to find. The second line is a string $s$ — regular bracket sequence of length $n$ .

输入格式

Print a single string — a regular bracket sequence of length exactly $k$ such that it is also a subsequence of $s$ . It is guaranteed that such sequence always exists.

输出格式

无

输入输出样例

输入 #1

6 4
()(())

输出 #1

()()

输入 #2

8 8
(()(()))

输出 #2

(()(()))

C++ 编辑器

输入

输出