POJ 1456 Supermarket

#include <cstdio>
#include <set>
#include <algorithm>
using namespace std;

struct P{int v, d;}p[10005];
bool operator < (P a, P b) {return a.d < b.d;}
multiset<int> S;
multiset<int>::iterator it;

int main()
{
int n;

while(~scanf("%d", &n))
{
S.clear();

for(int i = 1; i <= n; i++)
scanf("%d%d", &p[i].v, &p[i].d);
sort(p + 1, p + n + 1);

for(int i = 1; i <= n; i++)
{
if(S.size() < p[i].d)
S.insert(p[i].v);
else
{
if(*S.begin() >= p[i].v) continue;
S.erase(S.begin());
S.insert(p[i].v);
}
}

int sum = 0;
for(it = S.begin(); it != S.end(); it++)
sum += *it;

printf("%d\n", sum);
}

return 0;
}

#include <cstdio>
#include <algorithm>
using namespace std;

struct P{int v, d;}p[10005];
bool operator < (P a, P b) {return a.v > b.v;}
int fa[10005];

int find(int n)
{
if(fa
== 0)
return 0;
if(fa
!= n)
fa
= find(fa
);
return fa
;
}

int main()
{
int n;

while(~scanf("%d", &n))
{
int Max = 0;
for(int i = 1; i <= n; i++)
{
scanf("%d%d", &p[i].v, &p[i].d);
if(Max < p[i].d) Max = p[i].d;
}
for(int i = 0; i <= Max; i++)
fa[i] = i;
sort(p + 1, p + n + 1);

int sum = 0;
for(int i = 1; i <= n; i++)
{
int k = find(p[i].d);
if(k == 0) continue;
fa[k] = fa[k - 1];
sum += p[i].v;
}

printf("%d\n", sum);
}

return 0;
}