贪心好题
在所有怪物中有一些是加血的,有一些是扣血的
显然我们应该先打加血的,扣的低的优先
那么对于肯定要扣血的,我们让加血多的优先
tmd 要开longlong?我又被坑了
#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(s) freopen(s".in", "r", stdin), freopen(s."out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 100010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-7 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }
struct node {
int mi, add, id ;
} a[N] ;
int n, m ;
bool cmp(node a, node b) {
int x = a.add - a.mi, y = b.add - b.mi ;
if (x >= 0 && y >= 0) return a.mi < b.mi ; // 都可加血,扣血低的优先
else if (x * y <= 0) return x >= 0 ; // 加血的优先
else return a.add > b.add ; // 都扣血,加血多的优先
}
signed main(){
scanf("%lld%lld", &n, &m) ;
rep(i, 1, n) {
scanf("%lld%lld", &a[i].mi, &a[i].add) ;
a[i].id = i ;
}
sort(a + 1, a + n + 1, cmp) ;
rep(i, 1, n) {
m -= a[i].mi ;
if (m <= 0) PRINT("NIE") ;
m += a[i].add ;
}
puts("TAK") ;
rep(i, 1, n) printf("%lld ", a[i].id) ;
return 0 ;
}
/*
写代码时请注意:
1.ll?数组大小,边界?数据范围?
2.精度?
3.特判?
4.至少做一些
思考提醒:
1.最大值最小->二分?
2.可以贪心么?不行dp可以么
3.可以优化么
4.维护区间用什么数据结构?
5.统计方案是用dp?模了么?
6.逆向思维?
*/