#include <iostream> #include <algorithm> #include <stdio.h> #include <string> #include <vector> #include <map> #include <stack> #include <set> #include <math.h> #include <queue> #define INF 1000000007 #define MAXN 100002 using namespace std; int main() { cin.tie(NULL); ios::sync_with_stdio(false); int N; long long Z; cin >> N >> Z; vector< pair<int, int> > *g = new vector< pair<int,int> >; vector< pair<int, int> > *b = new vector< pair<int,int> >; vector< pair<int, int> > *m = new vector< pair<int,int> >; vector< pair<int, int> > &good = *g; vector< pair<int, int> > &bad = *b; vector< pair<int, int> > &monsters = *m; monsters.push_back( pair<int,int>(0,0) ); for(int i = 1; i <= N; i++) { int damage, health; cin >> damage >> health; monsters.push_back( pair<int,int>(damage,health)); if(health - damage > 0) { good.push_back( pair<int,int>(damage, i)); } else { bad.push_back( pair<int,int>(health, i)); } } sort(good.begin(), good.end() ); sort(bad.begin(), bad.end(),greater<pair<int,int> >() ); for(int i = 0; i < good.size(); i++) { int next = good[i].second; int damage = monsters[next].first; int health = monsters[next].second; if(Z <= damage) { cout << "NIE"; return 0; } Z -= damage; Z += health; } for(int i = 0; i < bad.size(); i++) { int next = bad[i].second; int damage = monsters[next].first; int health = monsters[next].second; if(Z <= damage) { cout << "NIE"; return 0; } Z -= damage; Z += health; } cout << "TAK\n"; for(int i = 0; i < good.size(); i++) { cout << good[i].second << " "; } for(int i = 0; i < bad.size(); i++) { cout << bad[i].second << " "; } return 0; }
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 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 | #include <iostream> #include <algorithm> #include <stdio.h> #include <string> #include <vector> #include <map> #include <stack> #include <set> #include <math.h> #include <queue> #define INF 1000000007 #define MAXN 100002 using namespace std; int main() { cin.tie(NULL); ios::sync_with_stdio(false); int N; long long Z; cin >> N >> Z; vector< pair<int, int> > *g = new vector< pair<int,int> >; vector< pair<int, int> > *b = new vector< pair<int,int> >; vector< pair<int, int> > *m = new vector< pair<int,int> >; vector< pair<int, int> > &good = *g; vector< pair<int, int> > &bad = *b; vector< pair<int, int> > &monsters = *m; monsters.push_back( pair<int,int>(0,0) ); for(int i = 1; i <= N; i++) { int damage, health; cin >> damage >> health; monsters.push_back( pair<int,int>(damage,health)); if(health - damage > 0) { good.push_back( pair<int,int>(damage, i)); } else { bad.push_back( pair<int,int>(health, i)); } } sort(good.begin(), good.end() ); sort(bad.begin(), bad.end(),greater<pair<int,int> >() ); for(int i = 0; i < good.size(); i++) { int next = good[i].second; int damage = monsters[next].first; int health = monsters[next].second; if(Z <= damage) { cout << "NIE"; return 0; } Z -= damage; Z += health; } for(int i = 0; i < bad.size(); i++) { int next = bad[i].second; int damage = monsters[next].first; int health = monsters[next].second; if(Z <= damage) { cout << "NIE"; return 0; } Z -= damage; Z += health; } cout << "TAK\n"; for(int i = 0; i < good.size(); i++) { cout << good[i].second << " "; } for(int i = 0; i < bad.size(); i++) { cout << bad[i].second << " "; } return 0; } |