Codeforces Round #504 (rated, Div. 1 + Div. 2, based on VK Cup 2018 Final)-C-Bracket Subsequence

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char s[200005];
int main(){
  int k,n;
  int zk;
  int yk;
  while(~scanf("%d%d",&n,&k)){
    zk=0;
    yk=0;
    scanf("%s",s);
    int lens=strlen(s);
    for (int i=0;i<lens;i++){
      if (s[i]=='(' && zk<k/2){
            zk++;
       printf("(");
       }else if (s[i]==')' && yk<k/2){
           yk++;
           printf(")");
       }
    }
    printf("\n");
  }
  return 0;
}

猜你喜欢

转载自www.cnblogs.com/bluefly-hrbust/p/9496215.html