bool cmp (pair<int,int> a, pair<int,int> b) { if (a.first == b.first) { return a.second > b.second; } return a.first < b.first/* || a.second > b.second*/; } int process(vector<pair<int, int>>& arr, int n) { int timecount = 0; //计时器 int res = 0; //积分 //排序 sort(arr.begin(), arr.end(),cmp); //遍历 for (int i = 0; i < n; i++){ if (timecount < arr[i].first) { res += arr[i].second; timecount++; } } return res; } int main() { int n; int a; int b; vector<pair<int,int>> arr; cin>>n; int m = n; while (n) { cin>>a; cin>>b; arr.push_back(make_pair(a, b)); n--; } int h = process(arr,m); cout<<h<<endl; cout<<"hello,world"<<endl; return 0; }