#include <bits/stdc++.h>
using namespace std;
void print_width(long long x) {
  std::cout << std::fixed;
  std::cout << std::setprecision(x);
}
long long power(long long x, long long y, long long p = 1000000007) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
void printArr(long long a[], long long n) {
  for (long long i = 0; i < n; i++) cout << a[i] << " ";
  cout << endl;
}
void printVector(std::vector<long long> v) {
  for (long long i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << endl;
}
long long Min(long long a, long long b, long long c) {
  if (a < b and a < c) return a;
  if (b < c) return b;
  return c;
}
void initialize(long long arr[], long long n) {
  for (long long i = 0; i <= n; i++) arr[i] = i;
}
long long root(long long arr[], long long i) {
  while (arr[i] != i) {
    arr[i] = arr[arr[i]];
    i = arr[i];
  }
  return i;
}
void Union(long long arr[], long long a, long long b) {
  long long root_a = root(arr, a);
  long long root_b = root(arr, b);
  arr[root_a] = root_b;
}
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long power_wm(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long double dpower(long double x, long long y) {
  long double res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  print_width(1);
  long double n, k;
  cin >> n >> k;
  vector<pair<long double, long double>> s, p;
  long double cost = 0;
  for (long long i = 0; i < n; i++) {
    long double c, t;
    cin >> c >> t;
    if (t == 1) {
      s.push_back(make_pair(c, i + 1));
    } else {
      p.push_back(make_pair(c, i + 1));
      cost += c;
    }
  }
  sort(s.begin(), s.end(), greater<pair<long long, long long>>());
  ;
  sort(p.begin(), p.end(), greater<pair<long long, long long>>());
  ;
  if (s.size() == 0) {
    cout << cost << endl;
    print_width(0);
    long long rem = k - s.size();
    for (long long i = 0; i < rem - 1; i++) {
      cout << 1 << " ";
      cout << p[i].second << " ";
      cout << endl;
    }
    cout << p.size() - (rem - 1) << " ";
    for (long long i = 0; i < p.size() - (rem - 1); i++)
      cout << p[p.size() - i - 1].second << " ";
    return 0;
  }
  if (p.size() > 0 and (p[p.size() - 1].first < s[s.size() - 1].first) and
      s.size() >= k) {
    cost -= (p[p.size() - 1].first / 2);
    cost += (s[s.size() - 1].first);
  } else {
    cost += (s[s.size() - 1].first / 2);
  }
  for (long long i = 0; i < s.size() - 1; i++) {
    if ((i + 1) < k) {
      cost += (s[i].first / 2);
    } else {
      cost += (s[i].first);
    }
  }
  cout << cost << endl;
  print_width(0);
  if (s.size() >= k) {
    cout << p.size() + 1 + (s.size() - k) << " ";
    cout << s[s.size() - 1].second << " ";
    for (long long i = 0; i < p.size(); i++) cout << p[i].second << " ";
    if (s.size() > k)
      for (long long j = k - 1; j <= s.size() - 2; j++)
        cout << s[j].second << " ";
    cout << endl;
    for (long long i = 0; i < k - 1; i++) {
      cout << 1 << " ";
      cout << s[i].second << " ";
      cout << endl;
    }
  } else {
    long long rem = k - s.size();
    for (long long i = 0; i < s.size(); i++) {
      cout << 1 << " ";
      cout << s[i].second << " ";
      cout << endl;
    }
    for (long long i = 0; i < rem - 1; i++) {
      cout << 1 << " ";
      cout << p[i].second << " ";
      cout << endl;
    }
    cout << p.size() - (rem - 1) << " ";
    for (long long i = 0; i < p.size() - (rem - 1); i++)
      cout << p[p.size() - i - 1].second << " ";
  }
  return 0;
}
