23.Exploration-取绝对值排序

题目:

Bessie is traveling on a road teeming with interesting landmarks. The road is labeled just like a number line, and Bessie starts at the "origin" (x = 0). A total of N (1 ≤ N ≤ 50,000) landmarks are located at points x1, x2, ..., xN (-100,000 ≤ xi ≤ 100,000). Bessie wants to visit as many landmarks as possible before sundown, which occurs in T (1 ≤ T ≤ 1,000,000,000) minutes. She travels 1 distance unit in 1 minute.

Bessie will visit the landmarks in a particular order. Since the landmarks closer to the origin are more important to Farmer John, she always heads for the unvisited landmark closest to the origin. No two landmarks will be the same distance away from the origin.

Help Bessie determine the maximum number of landmarks she can visit before the day ends.

输入:

<p>* Line 1: Two space-separated integers: <i>T</i> and <i>N</i><br>* Lines 2..<i>N</i>+1: Line <i>i</i>+1 contains a single integer that is the location of the <i>i</i>th landmark: <i>x<sub>i</sub></i></p>

输出:

<p>* Line 1: The maximum number of landmarks Bessie can visit.</p>

样例:

25 5
10
-3
8
-7
1


4

题目大意:求一下离着原点最近的点然后求规定时间内的参观的点的个数,从第一个点到第二个点的路程其实是第一个点坐标-第二个点坐标的绝对值

代码:

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

#define MAX_N 50005

int A[MAX_N];
bool mycmp(int a, int b)
{
    return abs(a) < abs(b);
}

int main()
{
    int T, N;
    cin >> T >> N;
    for(int i = 0; i < N; i++)
        cin >> A[i];
    sort(A, A + N, mycmp);
    long long dis = 0;
    int ans = 0;
    int las = 0;
    for(int i = 0; i <= N; i++)
    {
        dis += abs(A[i] - las);
        ans++;
        if(dis > T)
        {
            ans--;
            break;
        }
        las = A[i];   ///上一个的位置
    }
    cout << ans << endl;
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值