第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-986 藏匿的刺客

#include <stdio.h>
int n,a[1002][3],b[2];
int mm=0;
void fun(int x,int y)
{
  int i,j;
  b[0]=a[x][0];
  b[1]=a[x][1];
  a[x][0]=a[y][0];
  a[x][1]=a[y][1];
  a[y][0]=b[0];
  a[y][1]=b[1];
}
int main()
{
  int i,j,k;
  scanf("%d",&n); 
  for(i=0;i<n;i++)
    //for(j=0;j<2;j++)
      scanf("%d %d",&a[i][0],&a[i][1]);
  for(i=0;i<n;i++)
  {
    for(j=i+1;j<n;j++)
    {
      if(a[i][1]>a[j][1])
        fun(i,j);
      
    }
    //printf("   %d %d\n",a[i][0],a[i][1]);
  }
    
  for(i=0;i<n;i++)
    if(!a[i][2])
    {
      for(j=0;j<n;j++)
      if(!a[j][2])
      {
        if(a[j][0]<a[i][1])
        {
          a[j][2]=1;
          //printf("%d ",a[j][1]);
        }
          
      }
      mm++;
      //printf("%d,%d\n",a[i][0],a[i][1]);
    }
  printf("%d",mm);  
  return 0;
}

#include<iostream>
using namespace std;
int main() {
  int n;
  cin >> n;
  int s[1000][2];
  for (int i = 0;i < n;i++) {
    cin >> s[i][0];
    cin >> s[i][1];
  }
  for (int j = 0;j < n;j++) {
    for (int i = 0;i < n - 1;i++) {
      if (s[i][1] > s[i + 1][1]) {
        int temp1, temp2;
        temp1 = s[i][0];
        temp2 = s[i][1];
        s[i][0] = s[i + 1][0];
        s[i][1] = s[i + 1][1];
        s[i + 1][0] = temp1;
        s[i + 1][1] = temp2;
      }
    }
  }int sum = n, temp = s[0][1];
  for (int i = 1;i < n;i++) {
    if (temp > s[i][0]) 
      sum--;    
    else
      temp = s[i][1];
  }
  cout << sum;
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
class grass{
  int left;
  int right;
  public grass(int left, int right) {
    this.left = left;
    this.right = right;
  }
}
public class Main {
  public static void main(String[] args) throws IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    //读取第一行
    int n = Integer.parseInt(br.readLine());
    List<grass> list = new ArrayList<>();
    for (int i = 0; i < n; i++) {
      String[] s = br.readLine().split(" ");
      int a = Integer.parseInt(s[0]);
      int b = Integer.parseInt(s[1]);
      list.add(new grass(a,b));
    }
    //排序
    list.sort(new Comparator<grass>() {
      @Override
      public int compare(grass o1, grass o2) {
        return o1.right-o2.right;
      }
    });
    int i=0;
    while (i<list.size()-1){//  下面的操作是，从当前开始，若下一个区间跟本区间重合，则合并，不重合则判断下一个
      if (list.get(i).right>list.get(i+1).left){//  合并连续的区间
        int r = list.get(i).right;
        int l = Math.max(list.get(i).left,list.get(i+1).left);
        list.set(0,new grass(l,r));// 修改区间后将新的区间放入集合
        //删除
        list.remove(i+1);
      }// 若重合，i值应不变，表示当前合并后的区间，不重合才使i指向下一个
      else i++;//  控制结束的符号
    }
    System.out.println(list.size());
  }
}

n = int(input())
list = []
for i in range(0, n):
    l, r = map(int, input().split())
    list.append([l, r])
list.sort(key=lambda x: x[1])
s = []
while len(list) != 0:
    minr = list[0][1]
    s.append(minr)
    k = 0
    l = list[k][0]
    while minr >= l:
        k += 1
        if k < len(list):
            l = list[k][0]
        else:
            minr = -1
    del list[0:k]
print(len(s))