1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include <iostream>
#include <algorithm>
using namespace std;

#define MAXN 200000



pair<int,pair<int,int> > pos[MAXN], neg[MAXN];

int main()
{
    int n;
    long long z;
    cin >> n >> z;

    int tmpO, tmpE;
    int npos = 0, nneg = 0;

    for(int i = 0; i < n; i++) {
        cin >> tmpO >> tmpE;
        if(tmpE >= tmpO)
            pos[npos++] = pair<int,pair<int,int> >(tmpO, pair<int,int>(tmpE,i));
        else
            neg[nneg++] = pair<int,pair<int,int> >(tmpE, pair<int,int>(tmpO,i));
    }

    if(npos > 0)
        sort(pos,pos+npos);
    if(nneg > 0)
        sort(neg,neg+nneg);

    for(int i = 0; i < npos; i++) {
        z -= pos[i].first;
        if(z <= 0) {
            cout << "NIE\n";
            return 0;
        }
        z += pos[i].second.first;
    }

    for(int i = nneg-1; i >=0 ; i--) {
        z -= neg[i].second.first;
        if(z <= 0) {
            cout << "NIE\n";
            return 0;
        }
        z += neg[i].first;
    }

    cout << "TAK\n";

    for(int i = 0; i < npos; i++) {
        cout << pos[i].second.second+1 << " ";
    }

    for(int i = nneg-1; i >= 0; i--) {
        cout << neg[i].second.second+1 << " ";
    }


    return 0;
}