Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- import java.util.Arrays;
- public class FUUUUUUCK2{
- public static void main(String[] args) {
- Scanner in=new Scanner(System.in);
- int n=in.nextInt();
- int[] a = new int[n];
- for (int i = 0; i <n ; i++) {
- a[i] = in.nextInt();
- }
- int k=in.nextInt();
- int[]b =new int[k];
- for (int i = 0; i <k; i++) {
- b[i]=in.nextInt();
- }
- int e=in.nextInt();
- int[] c = new int[e];
- for (int i = 0; i <e ; i++) {
- c[i]=in.nextInt();
- }
- int m=in.nextInt();
- int[] d = new int[m];
- for (int i = 0; i <m ; i++) {
- d[i]=in.nextInt();
- }
- Arrays.sort(a);
- Arrays.sort(b);
- Arrays.sort(c);
- Arrays.sort(d);
- int raznost=20000003;
- int min=0;
- int min1=0;
- int min2=0;
- int min3=0;
- int i=0;
- int j=0;
- int r=0;
- int r2=0;
- while(i<n && j<k && r<e && r2<m) {
- if (Math.max(Math.max(a[i], b[j]), Math.max(c[r], d[r2])) - Math.min(Math.min(a[i], b[j]), Math.min(c[r], d[r2])) < raznost) {
- min = i;
- min1 = j;
- min2 = r;
- min3 = r2;
- raznost = Math.max(Math.max(a[i], b[j]), Math.max(c[r], d[r2])) - Math.min(Math.min(a[i], b[j]), Math.min(c[r], d[r2]));
- }
- if (i + 1 < n && Math.max(Math.max(a[i + 1], b[j]), Math.max(c[r], d[r2])) - Math.min(Math.min(a[i + 1], b[j]), Math.min(c[r], d[r2])) < Math.max(Math.max(a[i], b[j]), Math.max(c[r], d[r2])) - Math.min(Math.min(a[i], b[j]), Math.min(c[r], d[r2])) || (j == k && r == e && r2 == m)) {
- i++;
- } if (j + 1 < k && Math.max(Math.max(a[i], b[j + 1]), Math.max(c[r], d[r2])) - Math.min(Math.min(a[i], b[j + 1]), Math.min(c[r], d[r2])) < Math.max(Math.max(a[i], b[j]), Math.max(c[r], d[r2])) - Math.min(Math.min(a[i], b[j]), Math.min(c[r], d[r2])) || (i == n && r == e && r2 == m)) {
- j++;
- } if (r + 1 < e && Math.max(Math.max(a[i], b[j]), Math.max(c[r + 1], d[r2])) - Math.min(Math.min(a[i], b[j]), Math.min(c[r + 1], d[r2])) < Math.max(Math.max(a[i], b[j]), Math.max(c[r], d[r2])) - Math.min(Math.min(a[i], b[j]), Math.min(c[r], d[r2])) || (j == k && i == n && r2 == m)) {
- r++;
- } if (r2 + 1 < m && Math.max(Math.max(a[i], b[j]), Math.max(c[r], d[r2 + 1])) - Math.min(Math.min(a[i], b[j]), Math.min(c[r], d[r2 + 1])) < Math.max(Math.max(a[i], b[j]), Math.max(c[r], d[r2])) - Math.min(Math.min(a[i], b[j]), Math.min(c[r], d[r2])) || (j == k && r == e && i == n)) {
- r2++;
- }
- }
- System.out.println(a[min]+" " + b[min1]+ " "+c[min2]+" "+ d[min3]);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement