题目描述 有n个人在一个水龙头前排队接水,假如每个人接水的时间为Ti,请编程找出这n个人排队的一种顺序,使得n个人的平均等待时间最小. 分析 注意要开longlong AC代码 #include <bits/stdc++.h> using namespace std; const int maxn=1005; typedef long long ll; struct record{ int sum,id; }a[maxn]; int n; inline int read(){ int w=0,
Bryce1010模板 http://www.51nod.com/onlineJudge/questionCode.html#!problemId=2133 #include <bits/stdc++.h> using namespace std; int a[1100]; int main() { //cout << "Hello world!" << endl; int n; cin>>n; int sum=0; int x; for
#include <iostream> #include <algorithm> using namespace std; typedef long long LL; ; int n; int t[N]; int main() { scanf("%d", &n); ; i < n; i ++ ) scanf("%d", &t[i]); sort(t, t + n); reverse(t, t + n); LL res =