Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.io.BufferedReader;
- import java.io.BufferedWriter;
- import java.io.FileReader;
- import java.io.FileWriter;
- import java.io.IOException;
- import java.io.PrintWriter;
- import java.util.Arrays;
- import java.util.Comparator;
- import java.util.StringTokenizer;
- public class helpcross {
- public static int c, n;
- public static int[] chickens;
- public static Cow[] cows;
- public static void main(String[] args) throws IOException {
- BufferedReader br = new BufferedReader(new FileReader("helpcross.in"));
- PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("helpcross.out")));
- StringTokenizer st = new StringTokenizer(br.readLine());
- c = Integer.parseInt(st.nextToken());
- n = Integer.parseInt(st.nextToken());
- chickens = new int[c];
- cows = new Cow[n];
- for(int i = 0; i < c; i++) {
- chickens[i] = Integer.parseInt(br.readLine());
- }
- for(int i = 0; i < n; i++) {
- st = new StringTokenizer(br.readLine());
- Cow temp = new Cow(Integer.parseInt(st.nextToken()), Integer.parseInt(st.nextToken()));
- cows[i] = temp;
- }
- Arrays.sort(chickens);
- Arrays.sort(cows, new Comparator<Cow>() {
- public int compare(Cow c1, Cow c2) {
- if(c1.end < c2.end)
- return -1;
- if(c2.end < c1.end)
- return 1;
- if(c1.start < c2.start)
- return -1;
- if(c2.start < c1.start)
- return 1;
- return 0;
- }
- });
- // System.out.println(Arrays.toString(chickens));
- // System.out.println(Arrays.toString(cows));
- boolean[] visited = new boolean[c];
- for(Cow moo: cows) {
- for(int i = 0; i < c; i++) {
- if(!visited[i] && moo.start <= chickens[i] && chickens[i] <= moo.end) {
- visited[i] = true;
- break;
- }
- }
- }
- int ans = 0;
- for(boolean b: visited) {
- if(b)
- ans++;
- }
- out.println(ans);
- out.close();
- }
- static class Cow {
- int start, end;
- public Cow(int start, int end) {
- this.start = start;
- this.end = end;
- }
- public String toString() {
- return start + "," + end;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement