Submission

Status:

[-SSSS][-SSSS][-SSSS][-S][-][-][-][-][-S][-S]

Subtask/Task Score:

{0/10}{0/10}{0/10}{0/10}{0/10}{0/10}{0/10}{0/10}{0/10}{0/10}

Score: 0

User: Bestzu

Problemset: โดรน

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-17 10:16:43

#include <bits/stdc++.h>
#define endl '\n'
using namespace std;


void display(vector<int> &a) {
	for(auto &e : a) {
		cout << e << " ";
	}
	cout << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n; cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) {
    	cin >> a[i];
	}
//	sort(a.begin(), a.end(), greater<int>());
	
	display(a);
	
	vector<int> cost; //store all cost for each drone for each delivery ascending order;
	
	for(int i = 1; i <= 200; i++) {
		cost.push_back(i); //last delivery no return -> cost = i
		for(int j = 1; j <= 9; j++) { //delivery 1-9 cost = 2*i
			cost.push_back(2*i);
		}
	}
//	sort(cost.begin(), cost.end());
	display(cost);
	int dist = 0;
	for(int i = 0; i < n; i++) {
		dist += a[i] * cost[i];
	}
	cout << dist << endl;
    return 0;
}