京东2016机试题

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include<map>
#include<algorithm> 
using namespace std;
typedef pair<string, int> PAIR;
struct CmpByValue {
bool operator()(const PAIR& lhs, const PAIR& rhs) {
return lhs.second > rhs.second;
}
};




int main(){
int n, m;
while (cin >> m >> n){
vector<int> cost(m);
//vector<string> str(n);
map<string, int> pa;
// map<string,int> iter;
string str1;
int tem = m-1;
for (int i = 0; i < m; i++) cin>>cost[i];
sort(cost.begin(), cost.end());
for (int i = 0; i < n; i++)
{
cin >> str1;
++pa[str1];
}
int  maxsum=0;
int minsum = 0;
int k = 0;
vector<PAIR> ha(pa.begin(), pa.end());
sort(ha.begin(), ha.end(), CmpByValue());
vector<PAIR>::iterator it;
for (it =ha.begin(); it!=ha.end(); it++)
{
minsum += it->second *cost[k];
k++;
}
for (it = ha.begin(); it != ha.end(); it++)
{
maxsum += it->second *cost[tem];
tem--;
}



cout << minsum <<" "<<maxsum<<endl;
}
return 0;

}

编程不行，概念理解生疏。