POJ 2970 The lazy programmer 优先队列

Description

A new web-design studio, called SMART (Simply Masters of ART), employs two people. The first one is a web-designer and an executive director at the same time. The second one is a programmer. The director is so a nimble guy that the studio has already got N contracts for web site development. Each contract has a deadline di.

It is known that the programmer is lazy. Usually he does not work as fast as he could. Therefore, under normal conditions the programmer needs bi of time to perform the contract number i. Fortunately, the guy is very greedy for money. If the director pays him xi dollars extra, he needs only (bi − ai xi) of time to do his job. But this extra payment does not influent other contract. It means that each contract should be paid separately to be done faster. The programmer is so greedy that he can do his job almost instantly if the extra payment is (bi ⁄ ai) dollars for the contract number i.

The director has a difficult problem to solve. He needs to organize programmer’s job and, may be, assign extra payments for some of the contracts so that all contracts are performed in time. Obviously he wishes to minimize the sum of extra payments. Help the director!

Input

The first line of the input contains the number of contracts N (1 ≤ N ≤ 100 000, integer). Each of the next N lines describes one contract and contains integer numbers ai, bi, di (1 ≤ ai, bi ≤ 10 000; 1 ≤ di ≤ 1 000 000 000) separated by spaces.

Output

The output needs to contain a single real number S in the only line of file. S is the minimum sum of money which the director needs to pay extra so that the programmer could perform all contracts in time. The number must have two digits after the decimal point.

Sample Input

2
20 50 100
10 100 50

Sample Output

5.00

思路：

       结构数组以d从小到大排序，然后一次遍历对前n项合同进行分析，若前n项无法在制定时间完成，则需要花费金额加速合同，既然要求花费最少，自然是加速前n项合同中a值最大的那一项合同。采用一个优先队列，得到前n项中a权值最大的合同，这里需要注意，当前a最大的合同并不能无限加速，加速最多为该合同的b值。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
using namespace std;
#define _for(i,a,b) for(int i=(a);i<(b);i++)
#define _ref(i,a,b) for(int i=(a);i<=(b);i++)
#define ms(a, b) memset(a, b, sizeof(a))
#define fill(a,v,n) memset((a),(v),sizeof(a[0])*(n))
#define copy(a,b,n) memcpy((a),(b),sizeof(a[0])*(n))
#define sc(x) scanf("%d", &x)
#define pr(x) printf("%d", (x))
#define scl(x) scanf("%lld", &x)
#define prl(x) printf("%lld", (x))
#define sp putchar(' ')
#define en putchar('\n')
#define ALL(x) (x.begin(),x.end())
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define IOS ios::sync_with_stdio(0);cin.tie(0);
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define MOD 1000000007
void _max(int &a, int b){a = max(a,b);}
void _min(int &a, int b){a = min(a,b);}

ll pw(ll a, ll b){ll res(1);while(b){if(b&1)res=res*a%MOD;a=a*a%MOD;b>>=1;}return res;}
ll gcd(ll a, ll b){ll t;while(b){t=a%b;a=b;b=t;}return a;}
ll lcm(ll a, ll b){return a/gcd(a,b)*b;}
int len(ll x){int k=0;while(x){x/=10;k++;}return k;}
int len(int x){int k=0;while(x){x/=10;k++;}return k;}

const int infi = 2147483647;
const ll infl = 9223372036854775807ll;
const db PI = 3.14159265358979323846;

inline void rd(int &x){x = 0;char c = getchar();while(c<'0'||c>'9')c=getchar();while(c>='0'&&c<='9')x=x*10+(c&15),c=getchar();}
inline void llread(ll &x){char ch = getchar(); x = 0;for (; ch < '0' || ch > '9'; ch = getchar());for (; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';}

const int maxn = 100100;

struct node{
    ll a, b, d;
    bool operator < (const node &tmp) const{
        return a < tmp.a;
    }
}arr[maxn];

typedef node record;

priority_queue<record> q;
int n;

void init(){
    record p;
    rd(n);
    _for(i, 0, n){
        scl(arr[i].a);
        scl(arr[i].b);
        scl(arr[i].d);
    }
}

bool cmp(record a, record b){
    return a.d < b.d;
}

int main(){
    init();
    long double ans = 0;
    sort(arr, arr + n, cmp);
    ll sum = 0;
    for(int i = 0; i < n; i++) {
        q.push(arr[i]);
        sum += arr[i].b;    //任务需要天数
        while (sum > arr[i].d && !q.empty()) {  //需要花费金额加速
            record tmp = q.top();
            q.pop();
            if(sum - arr[i].d >= tmp.b){
                sum -= tmp.b;
                ans += (double) tmp.b / tmp.a;
            }else{
                ans +=  (double) (sum - arr[i].d) / tmp.a;
                tmp.b -= (sum - arr[i].d);
                sum = arr[i].d;
                q.push(tmp);
            }
        }
    }
    printf("%.2llf",ans);
}