【洛谷】P4995 跳跳！

最新推荐文章于 2024-03-29 20:04:31 发布

Yo3ngLau

最新推荐文章于 2024-03-29 20:04:31 发布

阅读量124

点赞数

分类专栏：洛谷文章标签：洛谷优先队列贪心

本文链接：https://blog.csdn.net/weixin_43359312/article/details/116565783

版权

洛谷专栏收录该内容

46 篇文章 1 订阅

订阅专栏

One

#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int n;
vector<int> v;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    cin >> n;
    int cur;
    v.push_back(0);
    for (int i = 0; i < n; i++){
        cin >> cur;
        v.push_back(cur);
    }
    sort(v.begin(), v.end());
    long long sum = 0;
    int b = 0, e = v.size()-1;
    while (b < e){
        sum += (v[e]-v[b])*(v[e]-v[b]);
        b++;
        sum += (v[e]-v[b])*(v[e]-v[b]);
        e--;
    }
    cout << sum;
    return 0;
}

Two

#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <cstdio>
#include <vector>
#include <functional>
using namespace std;
int n;
priority_queue<int, vector<int>, greater<int> > ql;
priority_queue<int, vector<int>, less<int> > qb;
vector<int> v;
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
//    freopen("in.txt", "r", stdin);
//    freopen("out.txt", "w", stdout);
    cin >> n;
    int cur;
    for (int i = 0; i < n; i++){
        cin >> cur;
        ql.push(cur);
        qb.push(cur);
    }
    v.push_back(0);
    for (int i = 0; i < n/2; i++){
            v.push_back(qb.top());
            v.push_back(ql.top());
            qb.pop(); ql.pop();

    }
    if (n%2) v.push_back(qb.top());
    long long sum = 0;
    for (int i = 1; i < v.size(); i++) sum += (v[i]-v[i-1])*(v[i]-v[i-1]);
    cout << sum;
    return 0;
}