BZOJ3709: [PA2014]Bohater

  1 #include<cstdio>
  2 
  3 #include<cstdlib>
  4 
  5 #include<cmath>
  6 
  7 #include<cstring>
  8 
  9 #include<algorithm>
 10 
 11 #include<iostream>
 12 
 13 #include<vector>
 14 
 15 #include<map>
 16 
 17 #include<set>
 18 
 19 #include<queue>
 20 
 21 #include<string>
 22 
 23 #define inf 1000000000
 24 
 25 #define maxn 100005
 26 
 27 #define maxm 500+100
 28 
 29 #define eps 1e-10
 30 
 31 #define ll long long
 32 
 33 #define pa pair<int,int>
 34 
 35 #define for0(i,n) for(int i=0;i<=(n);i++)
 36 
 37 #define for1(i,n) for(int i=1;i<=(n);i++)
 38 
 39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
 40 
 41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
 42 
 43 #define mod 1000000007
 44 
 45 using namespace std;
 46 
 47 inline int read()
 48 
 49 {
 50 
 51     int x=0,f=1;char ch=getchar();
 52 
 53     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
 54 
 55     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
 56 
 57     return x*f;
 58 
 59 }
 60 int n,l,r;
 61 struct rec{int x,y,id;}b[maxn];
 62 ll hp;
 63 bool flag;
 64 inline bool cmp1(rec a,rec b)
 65 {
 66     return a.x<b.x;
 67 }
 68 inline bool cmp2(rec a,rec b)
 69 {
 70     return a.y>b.y;
 71 }
 72 
 73 int main()
 74 
 75 {
 76 
 77     freopen("input.txt","r",stdin);
 78 
 79     freopen("output.txt","w",stdout);
 80 
 81     n=read();hp=read();
 82     l=0;r=n+1;
 83     for1(i,n)
 84      {
 85         int x=read(),y=read();
 86          if(x<y)b[++l].x=x,b[l].y=y,b[l].id=i;
 87         else b[--r].x=x,b[r].y=y,b[r].id=i;
 88     }
 89     sort(b+1,b+l+1,cmp1);sort(b+r,b+n+1,cmp2);
 90     for1(i,n)
 91     {
 92         hp-=(ll)b[i].x;
 93         if(hp<=0){flag=1;break;}
 94         hp+=(ll)b[i].y;
 95     }
 96     if(flag)printf("NIE\n");
 97     else 
 98     {
 99         printf("TAK\n");
100         for1(i,n-1)printf("%d ",b[i].id);
101         printf("%d\n",b[n].id);
102     }
103 
104     return 0;
105 
106 }