about summary refs log tree commit diff
path: root/codechef/wtbtr.c
diff options
context:
space:
mode:
authorNguyễn Gia Phong <vn.mcsinyx@gmail.com>2019-05-14 11:55:28 +0700
committerNguyễn Gia Phong <vn.mcsinyx@gmail.com>2019-05-14 11:55:28 +0700
commit267b2db7addc95c5eebb8bfb9ceeb7b953d85732 (patch)
tree8a9669a99fccaf520b3cb690143e539c58a92ca5 /codechef/wtbtr.c
parent887c286cc8228e13f85b587ab92b37e920161eb9 (diff)
downloadcp-267b2db7addc95c5eebb8bfb9ceeb7b953d85732.tar.gz
I has always believed that I'm good at solving math problems
Turns out I has been wrong all the time. And I'm not alone.
Diffstat (limited to 'codechef/wtbtr.c')
-rw-r--r--codechef/wtbtr.c43
1 files changed, 43 insertions, 0 deletions
diff --git a/codechef/wtbtr.c b/codechef/wtbtr.c
new file mode 100644
index 0000000..db8a90b
--- /dev/null
+++ b/codechef/wtbtr.c
@@ -0,0 +1,43 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int cmpl(const void *x, const void *y)
+{
+	long tmp = *(long *) x - *(long *) y;
+	if (tmp > 0)
+		return 1;
+	if (tmp)
+		return -1;
+	return 0;
+}
+
+int main()
+{
+	int i, n, t;
+	long x, y, u[10000], v[10000];
+	scanf("%d", &t);
+
+	while (t--) {
+		scanf("%d", &n);
+		for (i = 0; i < n; ++i) {
+			scanf("%ld %ld", &x, &y);
+			u[i] = x + y;
+			v[i] = x - y;
+		}
+
+		qsort(u, n, sizeof(long), cmpl);
+		qsort(v, n, sizeof(long), cmpl);
+
+		long tmp, min = u[n - 1] - *u;
+		for (i = 1; i < n; ++i)
+			if ((tmp = u[i] - u[i - 1]) < min)
+				min = tmp;
+		for (i = 1; i < n; ++i)
+			if ((tmp = v[i] - v[i - 1]) < min)
+				min = tmp;
+
+		printf("%.1f\n", min / 2.0);
+	}
+
+	return 0;
+}