题目:
代码一:(部分正确,15分)
第一次写的代码,只对了一部分,没什么参考价值,看看也行,主要是记录一下菜菜的代码。
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
struct id {
string s;
};
struct dianzan {
string str;
int num;
};
bool shuyu(string str, id *idd, int n) {
for (int i = 0; i < n; i++)
if (str == idd[i].s) return true;
return false;
}
int main() {
int n;
cin >> n;
id ex[5005];
id cc[5005];
for (int i = 0; i < n; i++)
cin>>ex[i].s;
int m;
cin >> m;
dianzan dz[10001];
for (int i = 0; i < m; i++) {
cin>> dz[i].str;
cin >> dz[i].num;
}
int sum = 0;
for (int i = 0; i < m; i++)
sum += dz[i].num;
double avg = double(sum) / (double)m;
int count = 0;
for (int j = 0; j < m; j++) {
if ((double)dz[j].num > avg && !shuyu(dz[j].str, ex, n)) {
cc[count++].s = dz[j].str;
}
}
if (count == 0) cout << "Bing Mei You";
else {
for (int i = 0; i < count; i++) {
for (int j = 0; j < count - 1 - i; j++) {
if (cc[j].s > cc[j + 1].s) {
string tem = cc[j].s;
cc[j].s = cc[j + 1].s;
cc[j + 1].s = tem;
}
}
}
for (int i = 0; i < count; i++) {
cout << cc[i].s;
if (i != count - 1) cout << endl;
}
}
return 0;
}
代码二:(答案正确,25分)
这次改进了代码,主要思路是先将关注用户ID存储起来,然后查找点赞但是不是关注用户的用户ID,有序存储在从中查找悄悄关注。
#include <iostream>
#include <set>
#include <map>
using namespace std;
set<string>a;
map<string, int>b;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
a.insert(s);
} //得到有序的关注用户ID
int m;
cin >> m;
int sum=0; //点赞次数和
double avg; //平均点赞次数
for (int i = 0; i < m; i++) {
string s;
int num;
cin >> s >> num;
sum += num;
if (a.find(s) == a.end()) { //点赞但是并未在关注用户名单(a)里
b.insert(map<string,int>::value_type(s,num));
}
}
avg = (double)sum / m;
int flag = 0; //标记是否有悄悄关注
map<string, int>::iterator it;
for (it = b.begin(); it != b.end(); it++) {
if ((double)it->second > avg) {
cout << it->first << endl;
flag = 1;
}
}
if (flag == 0) cout << "Bing Mei You";
return 0;
}
此次使用到了set容器和map容器。
如有大佬有更好的解题思路可以评论,我们一起讨论滴。
个人觉得这种容器真的香!!!!!