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
64
65
66
67
68
69
#include<cstdio>
#include<algorithm>
using namespace std;

class Monster
{
    public:

    int number, elixir, damage;

    bool inMinus()
    {
        return (damage > elixir);
    }
};

bool operator<(Monster a, Monster b)
{
    if (!a.inMinus() && b.inMinus() )
        return true;

    if (a.inMinus() &&  b.inMinus() )
        return (a.elixir > b.elixir);

    if (a.inMinus() &&  !b.inMinus() )
        return false;

    if (!a.inMinus() &&  !b.inMinus() )
        return (a.damage < b.damage);
}

int main()
{
    int n,z;
    Monster t[100001];
    bool answer;

    scanf("%d%d",&n,&z);

    for (int i=0; i<n; i++)
    {
        scanf("%d%d",&(t[i].damage),&(t[i].elixir));
        t[i].number = i+1;
    }

    sort(t, t+n);

    answer = true;

    for (int i=0; i<n; i++)
    {
        if (z <= t[i].damage)
        {
            answer = false;
            break;
        }

        z = z - t[i].damage + t[i].elixir;
    }

    if (answer)
    {
        printf("TAK\n");

        for (int i=0; i<n-1; i++) printf("%d ", t[i].number);
        printf("%d", t[n-1].number);
    }
    else printf("NIE");
}