-
Notifications
You must be signed in to change notification settings - Fork 0
/
B.cpp
42 lines (32 loc) · 950 Bytes
/
B.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
#define endl "\n";
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll const inf = 1e18;
ll const maxn = 1e6+5;
ll const mod = 1e9+7;
// code begins here
int main(){
fast;
ll n;
cin>>n;
map<string, ll> mp;
mp["ABC"] = inf;
mp["A"] = inf; mp["B"] = inf; mp["C"] = inf;
mp["AB"] = inf; mp["BC"] = inf; mp["AC"] = inf;
for(ll i=0;i<n;i++){
ll c;
string s;
cin>>c>>s;
sort(s.begin(), s.end());
mp[s] = min(mp[s], c);
}
ll ans = min(mp["ABC"], mp["A"] + mp["B"] + mp["C"]);
ans = min(ans, mp["AB"] + mp["BC"] + mp["AC"] - max({mp["AB"],mp["BC"],mp["AC"]}));
ans = min({ans, mp["AC"]+mp["B"], mp["AB"]+mp["C"], mp["BC"]+mp["A"] });
cout<<(ans==inf ? -1 : ans )<<endl;
return 0;
}