此博客链接:https://www.cnblogs.com/ping2yingshi/p/12373817.html
今年暑假不AC()
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2037
#include<stdio.h> #include<math.h> #include<stdlib.h> #include<string.h> int main() { int n; while (~scanf_s("%d",&n)) { if (n == 0) break; int arr[100]; int arr1[100]; for (int i=0;i<n;i++)//读取数据 { scanf_s("%d", &arr[i]); scanf_s("%d", &arr1[i]); } int temp; int count; for (int i = 0; i < n; i++)//对结束时间进行选择排序,时间小的放前面 { for (int j = i; j < n-1; j++) { if (arr1[i] > arr1[j + 1]) { temp = arr1[i]; arr1[i] = arr1[j + 1]; arr1[j + 1] = temp; temp = arr[i]; arr[i] = arr[j + 1]; arr[j + 1] = temp; } } } int mintime = arr1[0]; count = 1; for (int i = 1; i < n ; i++)//找到每次最小的结束时间 { if (mintime <= arr[i]) { mintime = arr1[i]; count++; } } printf("%d\n", count); } return 0; }
原文:https://www.cnblogs.com/ping2yingshi/p/12373817.html