-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinaryStringMinimization.java
More file actions
65 lines (55 loc) · 1.55 KB
/
BinaryStringMinimization.java
File metadata and controls
65 lines (55 loc) · 1.55 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
import java.util.HashMap;
import java.util.Scanner;
public class BinaryStringMinimization
{
public static void main( String[] args )
{
Scanner s = new Scanner( System.in );
int t = s.nextInt();
while( t-- > 0 )
{
int n = s.nextInt();
int k = s.nextInt();
String S = s.next();
char[] cs = S.toCharArray();
int zPos = 0;
int oPos = 0;
while( k > 0 && oPos<(n-1))
{
for( int i = 0; i < n; i++ )
{
if(cs[i]=='1')
{
oPos = i;
break;
}
}
for( int i = 0; i < n; i++ )
{
if(cs[i]=='0' && oPos<i)
{
zPos = i;
break;
}
}
int diffPosition = zPos-oPos;
if(k>=diffPosition)
{
char c = cs[zPos];
cs[zPos] = cs[oPos];
cs[oPos] = c;
k-=diffPosition;
}
else
{
int index = zPos-k;
char c = cs[index];
cs[index] = cs[zPos];
cs[zPos] = c;
k=0;
}
}
System.out.println( cs );
}
}
}