CodeForces
来源:互联网 发布:linux磁盘分区命令 编辑:程序博客网 时间:2024/05/24 05:09
题意:给定一堆衣服和价格 每个衣服有正反两面 每面都有颜色 每个顾客会选择自己喜欢的颜色并且价格最低的衣服 输出卖出衣服的顺序
思路:用优先队列维护每个衣服 贪心满足条件的价格最低的衣服
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <queue>#include <stack>#include <vector>#define max_ 200010#define inf 0x3f3f3f3f#define ll long longusing namespace std;struct node{int num;int order;bool operator < (const node &a)const{return a.num<num;}}e;struct node p[max_];int n;bool vis[max_];priority_queue<node>q[4];int main(int argc, char const *argv[]){scanf("%d",&n);int i;for(i=1;i<=n;i++){scanf("%d",&p[i].num);p[i].order=i;}for(i=1;i<=n;i++){int x;scanf("%d",&x);q[x].push(p[i]);vis[i]=true;}for(i=1;i<=n;i++){int x;scanf("%d",&x);q[x].push(p[i]);}int m;scanf("%d",&m);while(m--){int x;scanf("%d",&x);while(1){if(q[x].size()==0){printf("-1 ");break;}else{e=q[x].top();q[x].pop();int v=e.order;if(vis[v]==false)continue;else{printf("%d ",e.num);vis[v]=false;break;}}}}return 0;}
阅读全文
0 0
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- 机器学习正则化
- azkaban 3.2 Job failed, Cannot request memory (Xms 0 kb, Xmx 0 kb) from system for job
- Windows下软件安装包——总结
- Map与JavaBean实体类之间的相互转化
- 正则表达式匹配-leetcode Regular Expression Matching
- CodeForces
- POJO简介
- Python f = open("C:\\Users\\geek\\Desktop\\python.txt", "r",encoding= 'utf-8')
- java实现人脸识别源码【含测试效果图】——前期准备工作及访问提示
- Redis中文API
- [iOS UICollectionView拖拽排序] 菜单管理 拖拽/点选/交换位置
- 程序算法之构造法之(体育彩票排列3模拟抽奖程序)
- IDEA + SVN 导入eclipse项目
- HTTP1.0、HTTP1.1和HTTP2.0的区别