【贪心】10.24assassin

---

题目分析

没有题目分析……

寄存一下神奇反悔贪心

 #include<bits/stdc++.h>
 const int maxn = ;

 struct node
 {
     int a,b;
     node(int x=, int y=):a(x),b(y) {}
     bool operator < (node x) const
     {
         return a < x.a;
     }
 }a[maxn],b[maxn];
 int T,n,m,mn,tot;
 int mx,ans,cnt1,cnt2;

 int read()
 {
     char ch = getchar();
     int num = ;
     bool fl = ;
     for (; !isdigit(ch); ch=getchar())
         if (ch=='-') fl = ;
     for (; isdigit(ch); ch=getchar())
         num = (num<<)+(num<<)+ch-;
     if (fl) num = -num;
     return num;
 }
 int main()
 {
     freopen("assassin.in","r",stdin);
     freopen("assassin.out","w",stdout);
     T = read();
     while (T--)
     {
         n = read(), m = read();
         cnt1 = cnt2 = mx = ans = tot = , mn = m+;
         for (int i=; i<=n; i++)
         {
             int x = read(), y = read();
             if (y) a[++cnt1] = node(x, y), mn = std::min(mn, x), tot += y;
             else b[++cnt2] = node(x, y);
         }
         std::sort(a+, a+cnt1+);
         std::sort(b+, b+cnt2+);
         if (m >= mn){
             mx = tot+, ans = mn;
             if (mx >= n){
                 printf("%d %d\n",n,mn);
                 continue;
             }
             cnt2 -= mx-cnt1;
             for (int i=; i<=cnt1; i++) b[++cnt2] = a[i];
             std::sort(b+, b+cnt2+);
             for (int i=; i<=cnt2&&mx<n; i++)
                 if (ans+b[i].a <= m) mx++, ans += b[i].a;
                 else break;
             printf("%d %d\n",mx,ans);
         }else{
             mx = ;
             for (int i=; i<=cnt2; i++)
                 if (b[i].a <= m) m -= b[i].a, mx++, ans += b[i].a;
             printf("%d %d\n",mx,ans);
         }
     }
     return ;
 }

END