Codeforces Round #410 (Div. 2) D. Mike and distribution(贪心)
来源:互联网 发布:淘宝封号花呗怎么处理 编辑:程序博客网 时间:2024/05/29 14:03
Mike has always been thinking about the harshness of social inequality. He's so obsessed with it that sometimes it even affects him while solving problems. At the moment, Mike has two sequences of positive integers A = [a1, a2, ..., an] and B = [b1, b2, ..., bn] of length neach which he uses to ask people some quite peculiar questions.
To test you on how good are you at spotting inequality in life, he wants you to find an "unfair" subset of the original sequence. To be more precise, he wants you to select k numbers P = [p1, p2, ..., pk] such that 1 ≤ pi ≤ n for 1 ≤ i ≤ k and elements in P are distinct. Sequence P will represent indices of elements that you'll select from both sequences. He calls such a subset P "unfair" if and only if the following conditions are satisfied: 2·(ap1 + ... + apk) is greater than the sum of all elements from sequence A, and 2·(bp1 + ... + bpk)is greater than the sum of all elements from the sequence B. Also, k should be smaller or equal to because it will be to easy to find sequence P if he allowed you to select too many elements!
Mike guarantees you that a solution will always exist given the conditions described above, so please help him satisfy his curiosity!
The first line contains integer n (1 ≤ n ≤ 105) — the number of elements in the sequences.
On the second line there are n space-separated integers a1, ..., an (1 ≤ ai ≤ 109) — elements of sequence A.
On the third line there are also n space-separated integers b1, ..., bn (1 ≤ bi ≤ 109) — elements of sequence B.
On the first line output an integer k which represents the size of the found subset. k should be less or equal to .
On the next line print k integers p1, p2, ..., pk (1 ≤ pi ≤ n) — the elements of sequence P. You can print the numbers in any order you want. Elements in sequence P should be distinct.
58 7 4 8 34 2 5 3 7
31 4 5
分析:按第一组数排序后,先把第一个选上,然后后边按顺序两两配对,每对中选同编号中第二组数较大的那一个数的编号,很容易发现这样选下来两组数都是符合条件的。
#include <bits/stdc++.h>#define N 100005using namespace std;struct thing{ int v,n; friend bool operator < (thing a,thing b) { return a.v > b.v; }}a[N];int n,cnt,b[N],ans[N];int main(){ scanf("%d",&n); for(int i = 1;i <= n;i++) { scanf("%d",&a[i].v); a[i].n = i; } sort(a+1,a+1+n); for(int i = 1;i <= n;i++) scanf("%d",&b[i]); ans[++cnt] = a[1].n; for(int i = 2;i <= n;i+=2) { if(i == n) ans[++cnt] = a[i].n; else if(b[a[i].n] > b[a[i+1].n]) ans[++cnt] = a[i].n; else ans[++cnt] = a[i+1].n; } cout<<cnt<<endl; for(int i = 1;i <= cnt;i++) cout<<ans[i]<<" ";}
- Codeforces Round #410 (Div. 2) D. Mike and distribution(贪心)
- CF-Codeforces Round #410 (Div. 2)-D-Mike and distribution
- Codeforces Round #410 (Div. 2) D. Mike and distribution 思维
- Codeforces Round #410 (Div. 2) Mike and distribution 思维
- Codeforces Round #410 Div2 D Mike and distribution
- Codeforces Round #410 (Div.2) D.Mike and distrubition-构造
- Codeforces 798D Mike and distribution(二维贪心)
- Codeforces-798D-Mike and distribution(贪心)
- codeforces 798 D. Mike and distribution 二维贪心
- CodeForces 798D Mike and distribution(二维贪心 + 思维)
- Codeforces Round #305 (Div. 2) 548D - Mike and Feet
- Codeforces Round #305 (Div. 2) D.Mike and Feet
- Codeforces Round #410 (Div. 2) C. Mike and gcd problem 贪心
- Codeforces Round #410 (Div. 2)-B. Mike and strings【STL+略贪心】
- Codeforces 798D Mike and distribution 构造
- codeforces 798D Mike and distribution
- codeforces 798D Mike and distribution
- CodeForces 798D Mike and distribution
- HttpServletRequest和HttpServletResponse详解
- grails学习总结
- Javascript闭包用法实例分析
- Unity3D中预制体Prefab的应用
- 下拉加载
- Codeforces Round #410 (Div. 2) D. Mike and distribution(贪心)
- 2017全球机器学习技术大会5月1日前报名享7折早鸟票优惠
- SQLite中使用CTE巧解多级分类的级联查
- SpringMVC的各种参数绑定方式
- 简述 什么是spring MVC
- HDU
- 当我在做技术管理时,我在做什么?
- Java读取TXT内容
- Pycharm-快捷键