2017.8.22坐标问题

    题意是找出所有在该点右上方区域不存在点的点，下面是简单的实现：

#!usr/bin/env python
#encoding:utf-8

'''
__Author__:沂水寒城
功能：坐标问题
'''


def test_func():
    n=int(raw_input())
    zuobiao=[]
    for i in range(n):
        zuobiao.append([int(one) for one in raw_input().split(' ')])
    zuobiao.sort(key=lambda e:e[0])
    res_list=[]
    for i in range(n):
        flag=True
        for j in range(n):
            if zuobiao[i][0]<zuobiao[j][0] and zuobiao[i][1]<zuobiao[j][1]:
                flag=False
                break
            else:
                pass
        if flag:
            res_list.append(zuobiao[i])
    for one in res_list:
        one_str=[str(i) for i in one]
        print ' '.join(one_str) 


if __name__ == '__main__':
    test_func()

结果如下：

5
1 2
4 6
5 3
7 5
9 0
4 6
7 5
9 0

4
1 3
2 2
3 0
4 5
4 5