import java.util.*;
import java.io.*;
public class cipele
{
static class Reader {
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Reader()
{
din = new DataInputStream(System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public Reader(String file_name) throws IOException
{
din = new DataInputStream(
new FileInputStream(file_name));
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public String readLine() throws IOException
{
byte[] buf = new byte[64]; // line length
int cnt = 0, c;
while ((c = read()) != -1) {
if (c == '\n') {
if (cnt != 0) {
break;
}
else {
continue;
}
}
buf[cnt++] = (byte)c;
}
return new String(buf, 0, cnt);
}
public int nextInt() throws IOException
{
int ret = 0;
byte c = read();
while (c <= ' ') {
c = read();
}
boolean neg = (c == '-');
if (neg)
c = read();
do {
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');
if (neg)
return -ret;
return ret;
}
public long nextLong() throws IOException
{
long ret = 0;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do {
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');
if (neg)
return -ret;
return ret;
}
public double nextDouble() throws IOException
{
double ret = 0, div = 1;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = (c == '-');
if (neg)
c = read();
do {
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');
if (c == '.') {
while ((c = read()) >= '0' && c <= '9') {
ret += (c - '0') / (div *= 10);
}
}
if (neg)
return -ret;
return ret;
}
private void fillBuffer() throws IOException
{
bytesRead = din.read(buffer, bufferPointer = 0,
BUFFER_SIZE);
if (bytesRead == -1)
buffer[0] = -1;
}
private byte read() throws IOException
{
if (bufferPointer == bytesRead)
fillBuffer();
return buffer[bufferPointer++];
}
public void close() throws IOException
{
if (din == null)
return;
din.close();
}
}
public static void main(String args[]) throws IOException
{
Reader sc = new Reader();
int n = sc.nextInt(), m = sc.nextInt();
int a[] = new int[n];
int b[] = new int[m];
for(int i = 0; i < n; i++)
{
a[i] = sc.nextInt();
}
for(int i = 0; i < m; i++)
{
b[i] = sc.nextInt();
}
Arrays.sort(a);
Arrays.sort(b);
int l = 0, r = 1000000000;
int ans = r;
while(l <= r)
{
int mid = (l + r) / 2;
int pos = 0;
boolean condition = true;
for(int i = 0; i < Math.min(n, m); i++)
{
if(pos == Math.max(m, n))
{
condition = false;
break;
}
if(n == Math.min(n, m))
{
if(Math.abs(b[pos] - a[i]) <= mid)
{
pos++;
continue;
}
}
if(m == Math.min(n, m))
{
if(Math.abs(a[pos] - b[i]) <= mid)
{
pos++;
continue;
}
}
i--;
pos++;
}
if(condition == true)
{
r = mid - 1;
ans = mid;
}
else
{
l = mid + 1;
}
}
System.out.println(ans);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
216 ms |
15544 KB |
Output is correct |
| 2 |
Correct |
711 ms |
21560 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
347 ms |
20736 KB |
Output is correct |
| 2 |
Correct |
320 ms |
21044 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
77 ms |
9200 KB |
Output is correct |
| 2 |
Correct |
186 ms |
17944 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
181 ms |
18048 KB |
Output is correct |
| 2 |
Correct |
180 ms |
16588 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
321 ms |
18044 KB |
Output is correct |
| 2 |
Correct |
254 ms |
18348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
186 ms |
17144 KB |
Output is correct |
| 2 |
Correct |
175 ms |
18084 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
190 ms |
17464 KB |
Output is correct |
| 2 |
Correct |
178 ms |
16660 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
350 ms |
21068 KB |
Output is correct |
| 2 |
Correct |
553 ms |
21312 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
342 ms |
21904 KB |
Output is correct |
| 2 |
Correct |
206 ms |
14796 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
362 ms |
21564 KB |
Output is correct |
| 2 |
Correct |
467 ms |
21184 KB |
Output is correct |
