刷题向 | tips | map逆向迭代器

#include<stdio.h>
#include<vector>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<limits>
#include<fstream>
#include<math.h>
#include<stack>
#include<queue>
#include<bitset>
#include<utility>
#include<set>
#include<map>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int N=10005;
const ll mod=1e9+7;
const int M=10000;
int main(){
	//多项式相加 
	map<int,double> mp;
	int k,i;
	double a;
	map<int,double>::iterator iter;
	for(int j=0;j<2;j++){
		cin>>k;
		while(k){
			cin>>i>>a;
			iter=mp.find(i);
			if(iter!=mp.end()){
				iter->second+=a;
				if(iter->second==0){
					mp.erase(iter);
				}
			}
			else{
				mp.insert(make_pair(i,a));
			}
			k--;
		}
	}
	cout<<mp.size();

	//逆向迭代器，按key值从大到小遍历
	map<int,double>::reverse_iterator it;
	for(it=mp.rbegin();it!=mp.rend();it++){
		printf(" %d %.1f",it->first,it->second);
	}
	 
    return 0;
}