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
#include <iostream>

using namespace std;

int main() {
	int n, HP;
	cin>>n;
	cin>>HP;
	int HP_Minus[n], HP_Plus[n];
	for(int i=0; i<n; i++)
	{
		cin >> HP_Minus[i];
		cin >> HP_Plus[i];
	}
	
	int ORDER[n], X=0;	
	
	for(int i=0; i<n; i++){
		if(HP_Plus[i] >= HP_Minus[i]){
			HP += HP_Plus[i];
			HP -= HP_Minus[i];
			
			HP_Plus[i] = -1;
			HP_Minus[i] = -1;
			
			ORDER[X] = i;
			X++;
		}
	}
	
	for(int i=0; i<n; i++){
		if(HP_Plus[i] != -1 && HP_Minus[i] != -1){
			HP += HP_Plus[i];
			HP -= HP_Minus[i];	
			
			ORDER[X] = i;	
			X++;	
		}
	}
	
	if(HP > 0){
    	printf("%s", "TAK");
   		printf("\n");
   		
   		for(int i=0; i<n; i++){
   			cout << (ORDER[i] + 1) << " ";
   		}
	}
	else{
    	printf("%s", "NIE");
	}
	
	return 0;
}