Codeforces Round #317 [AimFund Thanks-Round] (Div. 2)A Arrays
2016-05-27 20:37
447 查看
思路:水题
#include<bits\stdc++.h>
using namespace std;
const int maxn = 1e5+6;
int a[maxn];
int b[maxn];
int main()
{
int n1,n2;
scanf("%d%d",&n1,&n2);
int k,m;
scanf("%d%d",&k,&m);
for(int i = 1;i<=n1;i++)
scanf("%d",&a[i]);
for(int i = 1;i<=n2;i++)
scanf("%d",&b[i]);
sort(a+1,a+1+n1);
sort(b+1,b+1+n2);
if(a[k] < b[n2-m+1])
puts("YES");
else
puts("NO");
}
A. Arrays
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given two arrays A and B consisting
of integers, sorted in non-decreasing order. Check whether it is possible to choose knumbers
in array A and choose m numbers
in array B so that any number chosen in the first array is strictly less than any number chosen in the second array.
Input
The first line contains two integers nA, nB (1 ≤ nA, nB ≤ 105),
separated by a space — the sizes of arrays A and B,
correspondingly.
The second line contains two integers k and m (1 ≤ k ≤ nA, 1 ≤ m ≤ nB),
separated by a space.
The third line contains nA numbers a1, a2, ... anA ( - 109 ≤ a1 ≤ a2 ≤ ... ≤ anA ≤ 109),
separated by spaces — elements of array A.
The fourth line contains nB integers b1, b2, ... bnB ( - 109 ≤ b1 ≤ b2 ≤ ... ≤ bnB ≤ 109),
separated by spaces — elements of array B.
Output
Print "YES" (without the quotes), if you can choose k numbers
in array A and m numbers
in array B so that any number chosen in arrayA was
strictly less than any number chosen in array B. Otherwise, print "NO"
(without the quotes).
Examples
input
output
input
output
input
output
Note
In the first sample test you can, for example, choose numbers 1 and 2 from array A and number 3 from array B (1
< 3 and 2 < 3).
In the second sample test the only way to choose k elements in the first array and m elements
in the second one is to choose all numbers in both arrays, but then not all the numbers chosen in A will be less than all the numbers
chosen in B:
.
#include<bits\stdc++.h>
using namespace std;
const int maxn = 1e5+6;
int a[maxn];
int b[maxn];
int main()
{
int n1,n2;
scanf("%d%d",&n1,&n2);
int k,m;
scanf("%d%d",&k,&m);
for(int i = 1;i<=n1;i++)
scanf("%d",&a[i]);
for(int i = 1;i<=n2;i++)
scanf("%d",&b[i]);
sort(a+1,a+1+n1);
sort(b+1,b+1+n2);
if(a[k] < b[n2-m+1])
puts("YES");
else
puts("NO");
}
A. Arrays
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given two arrays A and B consisting
of integers, sorted in non-decreasing order. Check whether it is possible to choose knumbers
in array A and choose m numbers
in array B so that any number chosen in the first array is strictly less than any number chosen in the second array.
Input
The first line contains two integers nA, nB (1 ≤ nA, nB ≤ 105),
separated by a space — the sizes of arrays A and B,
correspondingly.
The second line contains two integers k and m (1 ≤ k ≤ nA, 1 ≤ m ≤ nB),
separated by a space.
The third line contains nA numbers a1, a2, ... anA ( - 109 ≤ a1 ≤ a2 ≤ ... ≤ anA ≤ 109),
separated by spaces — elements of array A.
The fourth line contains nB integers b1, b2, ... bnB ( - 109 ≤ b1 ≤ b2 ≤ ... ≤ bnB ≤ 109),
separated by spaces — elements of array B.
Output
Print "YES" (without the quotes), if you can choose k numbers
in array A and m numbers
in array B so that any number chosen in arrayA was
strictly less than any number chosen in array B. Otherwise, print "NO"
(without the quotes).
Examples
input
3 3 2 1 1 2 3 3 4 5
output
YES
input
3 3 3 3 1 2 3 3 4 5
output
NO
input
5 2 3 1 1 1 1 1 1 2 2
output
YES
Note
In the first sample test you can, for example, choose numbers 1 and 2 from array A and number 3 from array B (1
< 3 and 2 < 3).
In the second sample test the only way to choose k elements in the first array and m elements
in the second one is to choose all numbers in both arrays, but then not all the numbers chosen in A will be less than all the numbers
chosen in B:
.
相关文章推荐
- Codeforces Round #354 (Div. 2) E - The Last Fight Between Human and AI
- Leetcode 217. Contains Duplicate
- InnoDB Spin rounds per wait在>32位机器上可能为负
- 关于tools:context=".MainActivity"的解释
- CodeForces 675B Restoring Painting
- PyBrain库的example之NFQ流程图分析
- Exception in thread "main" org.hibernate.TransactionException: commit failed
- 集合中contains方法体会
- 本地运行hadoop-Failed to locate the winutils binary in the hadoop binary path-转载
- Map.containsKey方法——判断Map集合对象中是否包含指定的键名
- 修改document.domain会引起的问题
- kvm 安ERROR Failed to connect socket to '/var/run/libvirt/libvirt-sock': No such file or directory
- 利用document.domain来进行基础域名相同的跨域操作
- CodeForces675BRestoring Painting(数学规律计算)
- UltraISO制作U盘启动盘安装Win7/9/10系统攻略
- 当代人工智能的核心技术究竟是什么?
- Libcontainer Specification
- codeforces 675E Trains and Statistic 线段树+贪心统计
- 【Linux】linux常用基本命令 http://blog.csdn.net/xiaoguaihai/article/details/8705992/
- Tair部署dataserver报错too many open files浅析及解决方案