兄弟们,为什么我只有20%正确率
#include<iostream> #include<algorithm> #include<cstring> using namespace std; typedef struct node{ int v; int d; } goods; goods a[100004]; int t[100004]; int main(){ int n,maxd; while(cin>>n){ maxd = 0; memset(t,0,sizeof(t)); for(int i = 1; i <= n; i++){ cin>>a[i].v>>a[i].d; maxd = max(maxd,a[i].d); } for(int i = 1; i <= n; i++){ int origin = t[a[i].d]; t[a[i].d] = max(a[i].v,origin); } long long sum = 0; for(int i = 1; i <= maxd ; i++){ sum += t[i]; } cout<<sum<<endl; } return 0; }
全部评论
(0) 回帖