maxHappiness

#define _USE_MATH_DEFINES
#include<cmath>
#include<cstdio>
#include<cstring>
#include<fstream>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<deque>
#include<vector>
#include<string>
#include<bitset>
#include<complex>
using namespace std;
#define SZ(x) int((x).size())
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);++(i))
#define ROF(i,a,b) for(int (i)=(a);(i)>=(b);--(i))
#define REP(i,n) for(int (i)=0;(i)<(n);++(i))
#define REPD(i,n) for(int (i)=(n);(i)--;)
#define FE(i,a) for(int (i)=0;(i)<(int((a).size()));++(i))
#define MEM(a,val) memset((a),val,sizeof(a))
#define INF 100000000
#define LLINF 10000000000000000LL
#define PB push_back
#define PPB pop_back
#define SQR(a) ((a)*(a))
#define MP(a,b) make_pair((a),(b))
#define XX first
#define YY second
typedef vector<int> vint;
typedef vector<string> vstr;
typedef vector<long,long> vLL;
typedef double dbl;
typedef long double ldbl;
typedef vector<pair<int,int>> vpii;
typedef long long LL;
typedef pair<int,int> pii;
int maxHappiness(vint h,vstr s)
{
map<string,int> m;
FE(i,h)
{
m[s[i]]=max(m[s[i]],h[i]);
}
int res=0;
for(auto& i:m)
{
res+=i.YY;
}
return res;
}
int main()
{
int a[]={1,2,3,4,5,6,7,8,9,10,100};
string b[]={"a","b","c","d","e","e","d","c","b","a","abcde"};
vint h(a,a+sizeof(a)/sizeof(int));
vstr s(b,b+sizeof(b)/sizeof(string));
cout<<SZ(h)<<endl;
std::cout<<maxHappiness(h,s)<<endl;
return 0;
}