1117 Eddington Number (25分)

李小白~

于 2020-03-25 16:19:13 发布

阅读量153

点赞数

分类专栏： PAT（甲级）文章标签： c++

本文链接：https://blog.csdn.net/qq_40941722/article/details/105097920

版权

PAT（甲级）专栏收录该内容

130 篇文章 10 订阅

订阅专栏

题目

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(\le N)$ .

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer $N(\le10^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

题目大意

这道题半天没看懂题意😢😢😢，百度之后才明白，题意如下：
给出N天，要求出一个最大的E天，每天骑行的距离都大于E。

思路

这道题关键在于读懂题目吧，我觉得，题目本身很简单，对N天的骑行距离排序，然后正向遍历，当距离大于i时，说明有i天骑行距离下雨i。

代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;

int main(){
    vector<int> v;
    int n;
    scanf("%d", &n);
    v.resize(n);
    for(int i=0; i<n; i++)
        scanf("%d", &v[i]);
    sort(v.begin(), v.end());
    int i;
    for(i=0; i<n; i++){
        if(v[i] > n-i)
            break;
    }
    printf("%d\n", n-i);
    return 0;
}