虽然不是难如登天，但还是易如反掌

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int maxn = 1e9+1;
struct node{
	string s;
	int shili;
}a[100005];
bool cmp(node a, node b){
	return a.shili > b.shili;
}
int get_(string s){
	int i;
	for(i = 1; s[i - 1] != ':'; i++);
	int x = 0, f = 1;
	for(; s[i] != '\0'; i++){
		if(s[i] == 'm') return maxn++;
		if(s[i] == '-') f = -f;
		else x = x * 10 + s[i] - '0';
	}return x * f;
}
bool print(string s){
	int i;
	for(i = 0; s[i] != ':'; i++) cout << s[i];
	cout << ':';
	if(s[i + 1] == 'm'){
		cout << "max++\n";
		return 1;
	}return 0;
}
int main(){
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin >> a[i].s;
		a[i].shili = get_(a[i].s);
	}sort(a + 1, a + n + 1, cmp);
	for(int i = 1; i <= n; i++){
		if(!print(a[i].s)) cout << a[i].shili << endl;
	}
}