#include <cstdio> #include <algorithm> #include <vector> using namespace std; struct Monster{ int id; int damage; int elixir; }; bool compareByDamage(const Monster& left, const Monster& right){ return left.damage < right.damage; } bool compareByElixir(const Monster& left, const Monster& right){ return left.elixir < right.elixir; } int main(){ int n, initLife; scanf("%d%d", &n, &initLife); vector<Monster> positive; vector<Monster> negative; vector<int> result; long long lifeAfter = initLife; for(int i=0; i<n; i++){ Monster monster; scanf("%d%d", &monster.damage, &monster.elixir); monster.id = i+1; if(monster.elixir - monster.damage >= 0) positive.push_back(monster); else negative.push_back(monster); lifeAfter += monster.elixir - monster.damage; } if(lifeAfter <= 0){ printf("NIE\n"); return 0; } sort(positive.begin(), positive.end(), compareByDamage); sort(negative.begin(), negative.end(), compareByElixir); long long life = initLife; for(int i=0; i<positive.size(); i++){ if(life>positive[i].damage){ life += positive[i].elixir - positive[i].damage; result.push_back(positive[i].id); } else{ printf("NIE\n"); return 0; } } result.resize(result.size() + negative.size()); life = lifeAfter; for(int i=0; i<negative.size(); i++){ if(life > negative[i].elixir){ life += negative[i].damage - negative[i].elixir; result[result.size()-1-i] = negative[i].id; } else{ printf("NIE\n"); return 0; } } printf("TAK\n"); for(int i=0; i<result.size(); i++) printf("%d ", result[i]); printf("\n"); 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 | #include <cstdio> #include <algorithm> #include <vector> using namespace std; struct Monster{ int id; int damage; int elixir; }; bool compareByDamage(const Monster& left, const Monster& right){ return left.damage < right.damage; } bool compareByElixir(const Monster& left, const Monster& right){ return left.elixir < right.elixir; } int main(){ int n, initLife; scanf("%d%d", &n, &initLife); vector<Monster> positive; vector<Monster> negative; vector<int> result; long long lifeAfter = initLife; for(int i=0; i<n; i++){ Monster monster; scanf("%d%d", &monster.damage, &monster.elixir); monster.id = i+1; if(monster.elixir - monster.damage >= 0) positive.push_back(monster); else negative.push_back(monster); lifeAfter += monster.elixir - monster.damage; } if(lifeAfter <= 0){ printf("NIE\n"); return 0; } sort(positive.begin(), positive.end(), compareByDamage); sort(negative.begin(), negative.end(), compareByElixir); long long life = initLife; for(int i=0; i<positive.size(); i++){ if(life>positive[i].damage){ life += positive[i].elixir - positive[i].damage; result.push_back(positive[i].id); } else{ printf("NIE\n"); return 0; } } result.resize(result.size() + negative.size()); life = lifeAfter; for(int i=0; i<negative.size(); i++){ if(life > negative[i].elixir){ life += negative[i].damage - negative[i].elixir; result[result.size()-1-i] = negative[i].id; } else{ printf("NIE\n"); return 0; } } printf("TAK\n"); for(int i=0; i<result.size(); i++) printf("%d ", result[i]); printf("\n"); return 0; } |