VK Cup 2012 Qualification Round 2 E 无语凝噎

世界最悲剧的事情就是小号最后比大号还牛逼。。。。。。。本来我以为提交两次如果有任何一次ac了的话就算ac。。没想到最后提交的那次会把前面的全部覆盖。。坑爹啊。。。。。哥的大号丧失资格了。。╮(╯▽╰)╭！！！

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif

#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a)        for( int i = (a)-1 ; i >= 0 ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define SZ(a)           ((int)a.size())
#define PP(n,m,a)       puts("---");FF(i,n){FF(j,m)cout << a[i][j] << ' ';puts("");}
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("o33ut.txt","w",stdout)

const i64 inf64 = 0x3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-10;
const double pi = acos(-1.0);
const int maxn = 101111;

struct zz
{
    i64 s;
    i64 id;
    bool operator < (const zz & cmp ) const
    {
        return s > cmp.s;
    }
}zx;

vector<zz>fd;
zz qw[maxn][2];

map<i64,i64>m;
vector<i64>g[maxn];
i64 n,mc,mu;
i64 c[maxn];
i64 s[maxn];
i64 num[maxn];
vector<i64>sum[maxn];
vector<i64>v;
i64 dp[maxn];
i64 as[maxn][2];
vector<i64>vc;

vector<zz>f1,f2;

i64 max(i64 y1,i64 y2)
{
    if(y1>y2)
    {
        return y1;
    }
    return y2;
}

i64 min(i64 x,i64 y)
{
    if(x<y)
    {
        return x;
    }
    return y;
}

void init()
{
    FF(i,maxn)
    {
        g[i].clear();
        sum[i].clear();
        qw[i][0].s = -inf64;
        qw[i][1].s = -inf64;
    }
    mu = 0;
    v.clear();
    memset(num,0,sizeof(num));
    memset(s,0,sizeof(s));
    memset(c,0,sizeof(c));
    m.clear();
    memset(dp,0,sizeof(dp));
    memset(as,0,sizeof(as));
    return ;
}

int main()
{
    while(cin>>n)
    {
        i64 temp;
        init();
        v.pb(-99999999);
        for(int i=1;i<=n;i++)
        {
            scanf("%I64d%I64d",&c[i],&s[i]);
      //      cin>>c[i]>>s[i];
            v.pb(c[i]);
        }
        sort(v.begin(),v.end());
        temp = v[0];
        vc.clear();
        vc.pb(temp);
        for(int i=1;i<v.size();i++)
        {
            if(temp!=v[i])
            {
                temp = v[i];
                vc.pb(temp);
            }
        }
        v.clear();
        for(int i=0;i<vc.size();i++)
        {
            v.pb(vc[i]);
        }


        mc = v.size() - 1;
        for(int i=1;i<v.size();i++)
        {
            m[v[i]] = i;
        }
        i64 now;
        for(int i=1;i<=n;i++)
        {
            now = m[c[i]];
            g[now].push_back(s[i]);
        }
        for(int i=1;i<=mc;i++)
        {
            num[i] = g[i].size();
            mu = max(mu,num[i]);
            g[i].pb(inf64);
            sort(g[i].begin(),g[i].end());
            reverse(g[i].begin(),g[i].end());
            g[i][0] = 0;
            temp = 0;
            FF(j,g[i].size())
            {
                temp += g[i][j];
                sum[i].pb(temp);
            }
        }
        for(int i=1;i<=mu;i++)
        {
            fd.clear();
            FOR(j,1,mc)
            {
                if(i<=num[j])
                {
                    zx.s = sum[j][i];
                    zx.id = j;
                    fd.push_back(zx);
                }
            }
            sort(fd.begin(),fd.end());
            if(fd.empty())
            {
                assert(false);
            }
            qw[i][0] = fd[0];
            if(fd.size()>=2)
            {
                qw[i][1] = fd[1];
            }
            else
            {
                qw[i][1].id = -1;
                qw[i][1].s = -inf64;
            }
        }
        i64 q1,q2,w1,w2,r1,r2,r3,r4;

        for(int i=1;i<=mu;i++)
        {
            temp = -inf64;
            q1 = qw[i][0].s;
            q2 = qw[i][1].s;
            w1 = qw[i+1][0].s;
            w2 = qw[i+1][1].s;
            r1 = q1+q2;
            if(qw[i][0].id != qw[i+1][0].id)
            {
                r2 = q1+w1;
            }
            else
            {
                r2 = -inf64;
            }
            if(qw[i][1].id != qw[i+1][0].id)
            {
                r3 = q2+w1;
            }
            else
            {
                r3 = -inf64;
            }
            if(qw[i][0].id != qw[i+1][1].id)
            {
                r4 = q1+w2;
            }
            else
            {
                r4 = -inf64;
            }
            temp = max(max(r1,r2),max(r3,r4));
            dp[i] = temp;
            if(temp == r1)
            {
                as[i][0] = qw[i][0].id;
                as[i][1] = qw[i][1].id;
            }
            else if(temp == r2)
            {
                as[i][0] = qw[i][0].id;
                as[i][1] = qw[i+1][0].id;
            }
            else if(temp == r3)
            {
                as[i][0] = qw[i][1].id;
                as[i][1] = qw[i+1][0].id;
            }
            else if(temp == r4)
            {
                as[i][0] = qw[i][0].id;
                as[i][1] = qw[i+1][1].id;
            }
        }
        i64 ans= -inf64;
        i64 tid;
        for(int i=1;i<=mu;i++)
        {
            if(dp[i] > ans)
            {
                ans = dp[i];
                tid = i;
            }
        }

        cout<<ans<<endl;
        i64 mnum = min(num[as[tid][0]] , num[as[tid][1]]);
        i64 id1 = as[tid][0];
        i64 id2 = as[tid][1];
        if(num[as[tid][0]] == num[as[tid][1]])
        {
            cout<<mnum*2<<endl;
        }
        else
        {
            cout<<mnum*2+1<<endl;
        }
        f1.clear();
        f2.clear();
        for(int i=1;i<=n;i++)
        {
            if(m[c[i]] == id1)
            {
                zx.s = s[i];
                zx.id = i;
                f1.pb(zx);
            }
            else if(m[c[i]] == id2)
            {
                zx.s= s[i];
                zx.id = i;
                f2.pb(zx);
            }
        }
        sort(f1.begin(),f1.end());
        sort(f2.begin(),f2.end());

        if(f1.size() == f2.size())
        {
            for(int i=0;i<mnum-1;i++)
            {
                cout<<f1[i].id<<" "<<f2[i].id<<" ";
            }
            cout<<f1[mnum-1].id<<" "<<f2[mnum-1].id<<endl;
        }
        else  if(f1.size() > f2.size())
        {
            for(int i=0;i<mnum;i++)
            {
                cout<<f1[i].id<<" "<<f2[i].id<<" ";
            }
            cout<<f1[mnum].id<<endl;
        }
        else if(f2.size()>f1.size())
        {
            for(int i=0;i<mnum;i++)
            {
                cout<<f2[i].id<<" "<<f1[i].id<<" ";
            }
            cout<<f2[mnum].id<<endl;
        }
    }
    return 0;
}