1.牛牛找工作
这个问题一开始的思路是将工作按报酬从高到低排序,然后用小伙伴的能力依次匹配报酬,但是这样时间复杂度会超。
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
struct job {
int difficulty;
int pay;
};
bool cmp(job a, job b) {
return a.pay>b.pay;
};
int main(){
int m,n;
cin >> m>>n;
vector<job> jobs;
for (int i=0; i<n; i++) {
job example;
cin >>example.difficulty>>example.pay;
jobs.push_back(example);
}
vector<int> friends;
for (int i=0;i<m;i++) {
int tmp;
cin>> tmp;
friends.push_back(tmp);
}
sort(jobs.begin(),jobs.end(),cmp);
for (int i=0;i<m;i++){
int j=0;
while (j<n&&jobs[j].difficulty>friends[i]) j++;
if (j==n) cout<<0<<endl;
else cout<<jobs[j].pay<<endl;
}
return 0;
};
想了一个很奇葩的算法,对难度和能力都排序
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stdint.h>
using namespace std;
struct job {
int difficulty;
int pay;
};
struct people {
int id;
int ability;
};
bool cmp(job a, job b) {
return a.difficulty<b.difficulty;
};
bool cmp2(people a, people b) {
return a.ability<b.ability;
};
int main(){
int m,n;
cin >> m>>n;
vector<job> jobs;
for (int i=0; i<n; i++) {
job example;
cin >>example.difficulty>>example.pay;
jobs.push_back(example);
}
vector<people> friends;
for (int i=0;i<m;i++) {
people tmp;
cin>> tmp.ability;
tmp.id=i;
friends.push_back(tmp);
}
//job的难度从小到大
sort(jobs.begin(),jobs.end(),cmp);
//同学的ability从小到大小
sort(friends.begin(),friends.end(),cmp2);
vector<int> res(m,0);
int i=0;
int j=0;
while(i<n){//从难度最小的工作开始
//如果难度比当前同学的能力小,当前同学至少能拿这个价
if (jobs[i].difficulty<=friends[j].ability) {
res[friends[j].id]=max(res[friends[j].id],jobs[i].pay);
i++;
}
else {//如果难度超过当前同学,说明该找下个同学了,j++
j++;
}
if (j>=m) break;
}
//有可能出现能力为10的同学找了难度区间在[0,10]的最好工作a
//能力为20的同学找了难度区间在[11,20]的最好工作b,但是b<a
//所以每个阶段结束的时候,b要和a比一下,如果b<a则b=a;
for (int k=1;k<m;k++)
res[friends[k].id]=max(res[friends[k-1].id],res[friends[k].id]);
for (int i=0;i<m;i++)
cout<<res[i]<<endl;
return 0;
};
后来看了一下题解,发现这样做最简单:https://blog.csdn.net/weixin_36416680/article/details/80010667