CodeForces 23C-Oranges and Apples

最新推荐文章于 2025-05-06 16:51:07 发布

Wang_128

最新推荐文章于 2025-05-06 16:51:07 发布

阅读量622

点赞数

CC 4.0 BY-SA版权

分类专栏： Codeforces ----贪心

本文链接：https://blog.youkuaiyun.com/a664607530/article/details/51476221

Codeforces 同时被 2 个专栏收录

140 篇文章

订阅专栏

----贪心

22 篇文章

订阅专栏

解决一个算法挑战，从2N-1个盒子中选择N个盒子，确保包含至少一半的苹果和橙子。输入包括测试数量及每个盒子的苹果和橙子数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

In 2N - 1 boxes there are apples and oranges. Your task is to choose N boxes so, that they will contain not less than half of all the apples and not less than half of all the oranges.

Input

The first input line contains one number T — amount of tests. The description of each test starts with a natural number N — amount of boxes. Each of the following 2N - 1 lines contains numbers ai and oi — amount of apples and oranges in the i-th box (0 ≤ ai, oi ≤ 109). The sum of N in all the tests in the input doesn't exceed 105. All the input numbers are integer.

Output

For each test output two lines. In the first line output YES, if it's possible to choose N boxes, or NOotherwise. If the answer is positive output in the second line N numbers — indexes of the chosen boxes. Boxes are numbered from 1 in the input order. Otherwise leave the second line empty. Separate the numbers with one space.

Examples

input
2
2
10 15
5 7
20 18
1
0 0

output
YES
1 3
YES
1

#include <iostream>
#include <algorithm>
#include <stdio.h>

using namespace std;

struct node
{
    int a,b,o;
} x[200009];

int f(node p,node q)
{
    return p.a<q.a;
}

int main()
{
    int t,n,N,i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        N=2*n-1;
        for(i=1; i<=N; i++)
        {
            scanf("%d%d",&x[i].a,&x[i].b);
            x[i].o=i;
        }
        sort(x+1,x+N+1,f);
        printf("YES\n");
        for(i=2; i<N; i=i+2)
        {
            if(x[i].b>x[i-1].b)
                printf("%d ",x[i].o);
            else
                printf("%d ",x[i-1].o);
        }
        printf("%d\n",x[N].o);
    }
    return 0;
}