Cued In

#include <bits/stdc++.h>

using namespace std;

int main(){
	int n; cin >> n;
	map<string, int> l;
	l["red"] = 1;
	l["yellow"] = 2;
	l["green"] = 3;
	l["brown"] = 4;
	l["blue"] = 5;
	l["pink"] = 6;
	l["black"] = 7;
	int ans = 0;
	deque<int> p;
	for(int i = 0; i < n; ++i){
		string tmp; cin >> tmp;
		p.push_back(l[tmp]);
	}
	sort(p.begin(), p.end());
	int last = p.back();
	if(p.front() != 1)
		p.pop_back();
	ans+=last;
	//cout << "lis " <<ans << endl;
	while(p.size()){
		if(last != 1 && p.front() == 1){
			ans++;
			//cout << "lis " << 1 << endl;
			p.pop_front();
			last = 1;
		}
		else{
			if(last == 1 && p.back() == 1)
				break;
			last = p.back();
			ans+=last;
			//cout << "lis2 " << last << endl;
			if(p.size() == 0 || p.front() != 1)
				p.pop_back();
		}
	}
	cout << ans << '\n';
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED