LA 6398 Low Power

题意：有n个machine, 每个machine有2个chips，每个chip需要k个batteries供电，chip的功率为k个batteries中的最小值。给你2*n*k个batteries，问你 所有machine的两个chips的功率差的最大值，最小是多少。

方法: Binary Search, Greedy, Sorting

将优化问题转化成判定问题。对于一个限制d，使得所有machine中两个chips功率之差小于d，如果我们可以判定这样的d是否可行，那么只需二分搜索d的值然后判断即可。

Code:

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <cmath>
#include <set>
#include <list>
#include <deque>
#include <map>
#include <queue>
#include <fstream>
#include <cassert>

#include <cmath>
#include <sstream>
#include <time.h>
#include <complex>
#define Max(a,b) ((a)>(b)?(a):(b))
#define Min(a,b) ((a)<(b)?(a):(b))
#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define DFOR(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define rep(i,n) FOR(i,0,n)
#define repn(i,n) FORN(i,1,n)
#define drep(i,n) DFOR(i,n-1,0)
#define drepn(i,n) DFOR(i,n,1)
#define MAX(a,b) a = Max(a,b)
#define MIN(a,b) a = Min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define Reset(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(all(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)
#define forever for(;;)
#define PINF 1000000000000
#define newline '\n'

#define test if(1)if(0)cerr
using namespace std;

using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> ii;
typedef pair<double,double> dd;
typedef pair<char,char> cc;
typedef vector<ii> vii;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l4;
const double pi = acos(-1.0);

int n, k;
const int maxn = 1e6+1;
int b[maxn];
bool valid(int mid);
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    while (cin >> n >> k)
    {
        rep(i, 2*k*n)   cin >> b[i];
        sort(b, b+2*k*n);
        int left = 0, right = 1e9+1, mid, ans;
        while (left <= right)
        {
            mid = (left+right)>>1;
            if (valid(mid))
            {
                ans = mid;
                right = mid-1;
            }
            else
                left = mid+1;
        }
        cout << ans << newline;
    }
}
bool valid(int mid)
{
    int cnt = 0;
    if (b[1]-b[0] > mid)    return false;
    cnt += 1;
    int last = 0;
    for (int i = 2; cnt != n && i <= last+2*k && i < 2*k*n-1; ++i)
    {
        if (b[i+1]-b[i] <= mid)
        {
            cnt += 1;
            last = i;
            i += 1;
        }
    }
    return cnt==n;
}
/*
 2 3
 1 2 3 4 5 6 7 8 9 10 11 12
 2 2
 3 1 3 3 3 3 3 3
*/