BZOJ2700: 聚会

会爆int

先排一下序
O(n)贪心会错的

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
#define ll long long
char c;
inline void read(ll &a)
{
    a=0;do c=getchar();while(c<'0'||c>'9');
    while(c<='9'&&c>='0')a=(a<<3)+(a<<1)+c-'0',c=getchar();
}

inline ll min(ll x,ll y){return x<y?x:y;}
ll a[1001];
ll b[1001];
ll f[1001][1001][3][3];
const
  ll INF=1ll<<50;
int main()
{
    freopen("std.in","r",stdin);
    freopen("self.out","w",stdout);

    ll i,j,k,m,n,tot1=0,tot2=0;
    read(m),read(n);
    for(i=1;i<=n;i++) 
       {
       read(k),read(j);
         if(j)a[++tot1]=k;
         else b[++tot2]=k;
      }
    sort(a+1,a+1+tot1); sort(b+1,b+1+tot2);
    for(i=tot1+1;i<=n;i++)
        a[i]=INF;
    for(i=tot2+1;i<=n;i++)
        b[i]=INF;
        ll t,l;
    for(i=0;i<=m;i++)
     for(j=0;j<=n;j++)
     for(t=0;t<=2;t++)
     for(l=0;l<=2;l++)
       f[i][j][t][l]=INF;
    f[0][0][0][0]=0;
    ll ad,bd;
    for(i=1;i<=m;i++)
    {

        for(j=1,ad=a[j]*(m-i+1),bd=b[i-j]*(m-i+1);j<=i;j++,ad=a[j]*(m-i+1),bd=b[i-j]*(m-i+1))
            f[i][j][1][0]=min(f[i-1][j-1][0][0],min(f[i-1][j-1][0][1],f[i-1][j-1][0][2]))+ad,
            f[i][j][2][0]=f[i-1][j-1][1][0]+ad,
            f[i][j][0][1]=min(f[i-1][j][0][0],min(f[i-1][j][1][0],f[i-1][j][2][0]))+bd,
            f[i][j][0][2]=f[i-1][j][0][1]+bd;
    bd=b[i]*(m-i+1);
    f[i][0][0][1]=min(f[i-1][0][0][0],min(f[i-1][0][1][0],f[i-1][0][2][0]))+bd,
    f[i][0][0][2]=f[i-1][0][0][1]+bd;
    }
    ll ans=INF;
    for(i=0;i<=tot1;i++)
       ans=min(ans,f[m][i][0][0]),ans=min(ans,f[m][i][0][1]),ans=min(ans,f[m][i][0][2]),ans=min(ans,f[m][i][1][0]),ans=min(ans,f[m][i][2][0]);
    printf("%lld\n",ans);
    return 0;
}