Submission #48108612

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,s,e) for(ll i=s;i<=e;++i)
#define FFOR(i,s,e) for(ll i=s;i>=e;--i)

#define yesno(flg) if(flg){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define ALL(a) (a).begin(),(a).end()
#define mp make_pair
#define pb push_back
#define vl vector<ll>
#define vs vector<string>
#define so(a) sort(a.begin(),a.end())

#define fi first
#define se second
#define print(a) cout<<a<<endl
#define ssize(a) (ll)(a.size())

#define MAX_N 1002
#define i197 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

typedef pair<int,int> Pi;
typedef pair<ll, ll> P2;
typedef pair<P2,ll> P3;
typedef pair<P2,P2> P4;

const ll INF=1000000000000000001;


int main(){

	ios::sync_with_stdio(0);
	cin.tie(0);

	ll n;
	cin>>n;

	vl a(n);
	vector<P2> b(n);
	rep(i,n){
		cin>>a[i];
		b[i]=P2(a[i],i);
	}
	so(b);

	ll to=0;
	ll t=b[n-1].fi;
	vl ans(n);

	FFOR(i,n-2,0){
		if(b[i].fi==b[i+1].fi)ans[b[i].se]=to;
		else{
			to+=t;
			ans[b[i].se]=to;
			t=0;
		}
		t+=b[i].fi;
	}
	rep(i,n-1)cout<<ans[i]<<" ";
	print(ans[n-1]);

	return 0;
}

Submission Info

Judge Result