poj 2454 随机

题意：有三个区，要保证至少两个区的投票在k * 500之上。

思路；先排个序，然后将前k * 2大的数进行分成两个区，如果不符合的话就从两个区中得到这个数进行交换。

PS：随机是个好东西

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 50 + 10;

struct Node{
    int x,index;
}a[maxn];
bool cmp(Node x,Node y){return x.x > y.x;}
int c[maxn];
int main()
{
    int n;
    while( ~ scanf("%d",&n))
    {
        int k = n;n *= 3;
        for(int i = 1; i <= n; i ++)
            scanf("%d",&a[i].x),a[i].index = i;
        sort(a + 1,a + n + 1,cmp);
        ll sum1 = 0,sum2 = 0;
        for(int i = 1; i <= k; i ++)sum1 += a[i].x;
        for(int i = k + 1; i <= k * 2; i ++)sum2 += a[i].x;
        while(sum1 <= 500 * k || sum2 <= 500 *k)
        {
            int x1 = rand() % k + 1,x2 = rand() % k + k + 1;
            sum1 = sum1 - a[x1].x + a[x2].x;sum2 = sum2 - a[x2].x + a[x1].x;
            swap(a[x1],a[x2]);
        }
        for(int i = 1; i <= k * 2; i ++)
            printf("%d\n",a[i].index);
        for(int i = k * 2 + 1; i <= 3 * k; i ++)
            printf("%d\n",a[i].index);
    }
    return 0;
}