I can't understand why... Please, help!
My algo :

  sort(x, x + n);

  int fp = 0;
  while (x[fp] < 0)
    ++fp;

  int fn = fp - 1;

  if (!(x[fn] <= p && p <= x[fp])) {
    printf("Impossible\n");
    return 0;
  }

  if (p > 0) {
    if (x[fp] > p) {
      printf("%d ", p);
    } else {
      printf("Impossible\n");
      return 0;
    }
  } else {
    if (x[fn] > p) {
      printf("Impossible\n");
      return 0;
    } else {
      printf("%d ", (2 * x[fp] - p));
    }
  }

  if (p < 0) {
    if (x[fn] > p) {
      printf("Impossible\n");
      return 0;
    } else {
      printf("%d\n", (-p));
    }
  } else {
    if (x[fp] < p) {
      printf("Impossible\n");
      return 0;
    } else {
      printf("%d\n", (p - 2 * x[fn]));
    }
  }

give your mail i show you 2 variants ...

mikroz@gmail.com
thanks =)

Sended

so do u understand? ;-)