【BZOJ3709】【PA2014】Bohater

#include<bits/stdc++.h>
using namespace std;
#define MAXN	100005
struct info {long long cost, value; int home; };
int n, sa, sb, ans[MAXN], point;
info a[MAXN], b[MAXN];
long long sx, sy, value, tmp;
bool cmp (info x, info y) {
return x.cost < y.cost;
}
bool fail() {
sort(a + 1, a + sa + 1, cmp);
for (int i = 1; i <= sa; i++) {
ans[i] = a[i].home;
if (a[i].cost >= value) return true;
value += a[i].value - a[i].cost;
}
point = n; value = tmp;
sort(b + 1, b + sb + 1, cmp);
for (int i = 1; i <= sb; i++) {
ans[point--] = b[i].home;
if (b[i].cost >= value) return true;
value += b[i].value - b[i].cost;
}
printf("TAK\n");
for (int i = 1; i <= n; i++)
printf("%d ", ans[i]);
printf("\n");
return false;
}
int main() {
scanf("%d%lld", &n, &value);
for (int i = 1; i <= n; i++) {
long long x, y;
scanf("%lld%lld", &x, &y);
sx += x; sy += y;
if (x <= y) a[++sa] = (info) {x, y, i};
else b[++sb] = (info) {y, x, i};
}
if (sx > sy + value) {
printf("NIE\n");
return 0;
}
tmp = sy + value - sx;
if (fail()) printf("NIE\n");
return 0;
}