【HDOJ6335】Nothing is Impossible（贪心）

【【HDOJ6335】Nothing is Impossible（贪心）】的更多相关文章

【HDOJ6335】Nothing is Impossible（贪心）

题意: 有n道题目m个人,每道题目有1个正确选项和a[i]个错误选项,每个人每道题只能选一个选项求出最坏情况下分数最多的人至少能拿到几分 n<=1e2,m<=1e9,1<=b[i]<=1e2 思路: #include <stdio.h> #include <vector> #include <algorithm> #include <string.h> #include <limits.h> #include <s…

hdu6003 Problem Buyer 贪心给定n个区间，以及m个数，求从n个区间中任意选k个区间，满足m个数都能在k个区间中找到一个包含它的区间，如果一个区间包含了x，那么该区间不能再去包含另一个数，即k>=m。求最小的k。如果不存在这样的k，输出“IMPOSSIBLE!”。

/** 题目:hdu6003 Problem Buyer 链接:http://acm.hdu.edu.cn/showproblem.php?pid=6003 题意:给定n个区间,以及m个数,求从n个区间中任意选k个区间,满足m个数都能在k个区间中找到一个包含它的区间,如果一个区间包含了x,那么该区间不能再去包含另一个数,即k>=m.求最小的k.如果不存在这样的k,输出“IMPOSSIBLE!”. 思路:贪心; 对n个区间,先左端点进行由小到大排序,然后右端点由大到小.对m个数由小到大排序. 对…

CF732D. Exams[二分答案贪心]

D. Exams time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m. Ab…

【BZOJ-4082】Surveillance 树链剖分 LCA + 贪心

4082: [Wf2014]Surveillance Time Limit: 40 Sec Memory Limit: 128 MBSubmit: 260 Solved: 100[Submit][Status][Discuss] Description 给你一个长度为len的环,以及n个区间,要你选择尽量少的区间,使得它们完全覆盖整个环.问最少要多少个区间. Input 输入数据的第一行是两个整数len和n,代表环的长度以及区间个数.之后n行描述的是n个区间,每个区间分别用一对数字(a,b)…

UVALive 7146 Defeat the Enemy（贪心+STL）（2014 Asia Shanghai Regional Contest）

Long long ago there is a strong tribe living on the earth. They always have wars and eonquer others.One day, there is another tribe become their target. The strong tribe has decide to terminate them!!!There are m villages in the other tribe. Each vil…