Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- #include<iostream>
- #include<cmath>
- #include<iomanip>
- #include<algorithm>
- #include<cstdlib>
- #include<cstring>
- #include<vector>
- #include<utility>
- using namespace std;
- #define ll long long
- #define nl '\n'
- #define sz(x) int(x.size())
- #define all(x) x.begin(),x.end()
- #define rall(s) s.rbegin(), s.rend()
- #define getline(s) getline(cin>>ws,s)
- #define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
- #define pi 3.141592653589793
- void solve(){
- ll n; cin>>n;
- vector<ll>v;
- ll mini = LONG_LONG_MAX;
- ll min_idx = -1;
- for(int i=0; i<n; i++){
- ll x; cin>>x;
- v.push_back(x);
- if(x<mini){
- mini =x;
- min_idx = i;
- }
- }
- ll maxi = *max_element(v.begin(),v.begin()+min_idx);
- for(int i=0; i<min_idx; i++){
- if(v[i] == maxi){
- swap(v[min_idx],v[i]);
- break;
- }
- }
- ll sum =0;
- for(int i=0; i<n; i++){
- sum += (v[i]*(i+1));
- }
- cout<<sum<<nl;
- }
- int main(){
- ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
- freopen("cals.in", "r", stdin);
- int t =1;
- cin>>t;
- while(t--){
- solve();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement