1117 Eddington Number (25point(s)) - C语言 PAT 甲级

1117 Eddington Number (25point(s))

British astronomer Eddington liked to ride a bike. It is said that in order to show off his skill, he has even defined an “Eddington number”, E – that is, the maximum integer E such that it is for E days that one rides more than E miles. Eddington’s own E was 87.

Now given everyday’s distances that one rides for N days, you are supposed to find the corresponding E (≤N).

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤10​5​​), the days of continuous riding. Then N non-negative integers are given in the next line, being the riding distances of everyday.

Output Specification:

For each case, print in a line the Eddington number for these N days.

Sample Input:

10
6 7 6 9 3 10 8 2 7 8

Sample Output:

6

题目大意：

1060 爱丁顿数 (25point(s))

设计思路：

1060 爱丁顿数（C语言）

• 初看题目有点绕，读懂题，重点在于求 E 天

1. 降序排序骑车距离
2. 天数由 0 升序，依次比较，即可找到最大天数

编译器：C (gcc)

#include <stdio.h>

int comp(const void *a, const void *b)
{
    return *(int*)b - *(int*)a;
}

int main()
{
    int n, e, miles[100000];
    int i;

    scanf("%d", &n);
    for(i = 0; i < n; i++)
        scanf("%d", miles + i);
    qsort(miles, n, sizeof(int), comp);
    for(e = 0; e < n && miles[e] > e + 1; e++)
        continue;

    printf("%d\n", e);

    return 0;
}