zoj 1731 Supermarket

zoj 1731 Supermarket

#include <iostream>#include <cstdio>#include <queue>#include <cstring>using namespace std;struct Schedule{    int profit;    int dt;    bool operator<(const Schedule &rhs)const {        return profit<rhs.profit;    }};bool used[10001];priority_queue<Schedule> que;int main(){    int n;    while(scanf("%d",&n)!=EOF){        while(!que.empty())que.pop();        int max = 0;        for (int i=0;i<n;i++){ Schedule prod; scanf("%d %d",&prod.profit,&prod.dt); if (prod.dt>max) max = prod.dt; que.push(prod);        }        memset(used,false,sizeof(bool)*(max+1));        long long sum =0;        int current = 0;        while(!que.empty()){ Schedule prod = que.top(); que.pop(); while(prod.dt--){     if (!used[prod.dt]){         used[prod.dt] = true;         sum+=prod.profit;         break;     } }        }        printf("%dn",sum);    }    return 0;}