-
Notifications
You must be signed in to change notification settings - Fork 1
/
Fericit la munca.cpp
48 lines (45 loc) · 1.25 KB
/
Fericit la munca.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
43
44
45
46
47
48
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n;
string nume, profesie, fericire;
double scor;
vector<pair<string,double>>vec;
vector<pair<string,double>>out;
vector<pair<double,string>>final;
cin>>n;
for(int i=0;i<n;i++){
cin>>fericire>>scor;
vec.push_back(make_pair(fericire,scor));
}
while(cin>>nume>>fericire>>profesie){
for(int i=0;i<vec.size();i++){
if(vec[i].first==fericire){
scor=vec[i].second;
break;
}
}
out.push_back(make_pair(profesie,scor));
}
int cnt=1;
while(out.size()>0){
cnt=1;
for(int i=1;i<out.size();){
if(out[0].first==out[i].first){
out[0].second+=out[i].second;
cnt++;
out.erase(out.begin()+i);
}else i++;
}
final.push_back(make_pair(out[0].second/cnt,out[0].first));
out.erase(out.begin());
}
sort(final.begin(),final.end());
for(int i=final.size()-1;i>=0;i--){
cout<<final[i].second<<' ';
printf("%.2f\n",final[i].first);
}
}