oj.uz

Submission #58171

# Submission time Handle Problem Language Result Execution time Memory
58171 2018-07-17T05:23:17 Z 노영훈(#1688) Candies (JOI18_candies) C++11
0 / 100
 6 ms 376 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=500010, inf=2e9;

list<ll> X;
int n, A[MX];

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n;
    for(int i=1; i<=n; i++) cin>>A[i];
    for(int i=1; i<=n; i++) X.push_back(A[i]);
    
    ll ans=0;
    for(int j=1; j<=(n+1)/2; j++){
        auto it=max_element(X.begin(), X.end());
        ans+=*it;
        cout<<ans<<'\n';
        *it=-*it;
        if(it!=X.begin()) *it+=*prev(it), X.erase(prev(it));
        if(next(it)!=X.end()) *it+=*next(it), X.erase(next(it));
    }
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -