[原题地址](http://poj.org/problem?id=1456
蒟蒻想了很久,终于做出来了,这个题目应该要用结构体来解决
再排序,自定义一个cmp函数 // while(~scanf("%d %d",…) == ! =EOF ;再while循环里面用b来记录date的最大值,用数组a[1005];来储存利润,最后累加输出,完事,上代码分析
#include <iostream>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cctype>
#include <sstream>
using namespace std;
struct Nod
{
int price,date;
}node[10005];
int n,a[10005],ans;
bool cmp(Nod x,Nod y)
{
if(x.price > y.price)
return true;
else
return false;
}
int main()
{
// memset(a,0,sizeof(a));
while(scanf("%d",&n) !=EOF){ // == while(scanf("%d",&n) != EOF)
memset(a,0,sizeof(a));
int ans = 0 , b = 0 , i = 0 , j;
for (int i = 0; i < n; ++i)
{
scanf("%d%d",&node[i].price,&node[i].date);
}
sort(node , node + n ,cmp);
for ( i = 0; i < n; ++i)
{
b = max(b , node[i].date);
if(a[node[i].date] == 0){
a[node[i].date] = node[i].price;
}else
for (j = node[i].date; j > 0; j--)
if(a[j] == 0){
a[j] = node[i].price;
break;
}
}
for (int i = 0; i <= b; ++i)
{
ans += a[i];
}
cout << ans <<endl;
}
}
应该是没问题了 的,AC成功,但是这种方法比较笨。