CF#317DIV.2,ProblemA,水题
2015-08-23 11:55
246 查看
By L_FW, contest: Codeforces Round #317 [AimFund Thanks-Round] (Div. 2), problem: (A) Arrays, Accepted
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN=100010;
int nA,nB,k,m;
int A[MAXN],B[MAXN];
int main(){
scanf("%d%d",&nA,&nB);
scanf("%d%d",&k,&m);
for(int i=0;i<nA;i++) scanf("%d",&A[i]);
for(int i=0;i<nB;i++) scanf("%d",&B[i]);
if(A[k-1]<B[nB-m]) printf("YES\n");
else printf("NO\n");
}
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN=100010;
int nA,nB,k,m;
int A[MAXN],B[MAXN];
int main(){
scanf("%d%d",&nA,&nB);
scanf("%d%d",&k,&m);
for(int i=0;i<nA;i++) scanf("%d",&A[i]);
for(int i=0;i<nB;i++) scanf("%d",&B[i]);
if(A[k-1]<B[nB-m]) printf("YES\n");
else printf("NO\n");
}
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)
- Codeforces #264(div 2)D.Gargari and Permutations
- Codeforces Round #236 (Div. 2)------A,B
- codeforces 257 div2 B
- Codeforces Gym100571A Cursed Query
- Codeforces Gym100342E Minima
- Codeforces Gym100342J Triatrip
- Codeforces Gym100286B Blind Walk (dfs)
- Codeforces Gym100342J Triatrip