#include<bits/stdc++.h>#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);#define ms(a,b) memset(a,b,sizeof(a))#define rush() int T;cin>>T;while(T--)#define ll long longusingnamespace std;constint N =1e6+100;constint INF =0x3f3f3f3f;constdouble PI =acos(-1.0);struct node{int n;int t;}stu[N];boolcmp(node a,node b){if(a.t < b.t)return1;if(a.t == b.t && a.n < b.n)return1;return0;}
ll wait[N];intmain(){
FAST;
ll n,ans =0,cur =0;
cin>>n;for(int i =1;i <= n;i++){
stu[i].n = i;
cin>>stu[i].t;}sort(stu +1,stu + n +1,cmp);for(int i =1;i < n;i++){
cur += stu[i].t;
ans += cur;}for(int i =1;i < n;i++)cout<<stu[i].n<<" ";
cout<<stu[n].n<<endl;printf("%.2f",ans *1.0/ n);return0;}
E. P1803 凌乱的yyy线段覆盖
#include<bits/stdc++.h>#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);#define ms(a,b) memset(a,b,sizeof(a))#define rush() int T;cin>>T;while(T--)#define ll long long//两个测试点恶意爆空间 要开ll usingnamespace std;constint N =1e6+100;constint INF =0x3f3f3f3f;constdouble PI =acos(-1.0);struct node{int s;int e;}cot[N];boolcmp(node a,node b){if(a.e < b.e)return1;if(a.e == b.e && a.s < b.s)return1;return0;}intmain(){
FAST;
ll n,start,end,ans =1;
cin>>n;for(int i =1;i <= n;i++)cin>>cot[i].s>>cot[i].e;sort(cot +1,cot + n +1,cmp);
start = cot[1].s,end = cot[1].e;for(int i =2;i <= n;i++){if(cot[i].s >= end){
ans++;
start = cot[i].s;
end = cot[i].e;}}
cout<<ans;return0;}
F. P1208 [USACO1.3]混合牛奶 Mixing Milk
#include<bits/stdc++.h>#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);#define ms(a,b) memset(a,b,sizeof(a))#define rush() int T;cin>>T;while(T--)#define ll long longusingnamespace std;constint N =5005;constint INF =0x3f3f3f3f;constdouble PI =acos(-1.0);struct node{int value;int amount;}stu[N];boolcmp(node a,node b){if(a.value < b.value)return1;if(a.value == b.value && a.amount > b.amount)return1;return0;}intmain(){
FAST;int n,m,cost =0;
cin>>n>>m;for(int i =1;i <= m;i++)cin>>stu[i].value>>stu[i].amount;sort(stu +1,stu + m +1,cmp);for(int i =1;i <= m;i++){if(n >= stu[i].amount){
n -= stu[i].amount;
cost += stu[i].value * stu[i].amount;}else{
cost += n * stu[i].value;break;}}
cout<<cost;return0;}
G. P1094 纪念品分组
#include<iostream>#include<vector>#include<cstdio>#include<algorithm>#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);usingnamespace std;constint N =1e5;inlineintreadint()//快读 {int res =0;char c =0;while(!isdigit(c))
c =getchar();while(isdigit(c))
res = res *10+ c -'0', c =getchar();return res;}intmain(){
FAST;int maxn,n,cur,cnt =0;
maxn =readint();
n =readint();
vector<int>ans;for(int i =0;i < n;i++){
cur =readint();
ans.push_back(cur);}sort(ans.begin(),ans.end());while(!ans.empty()){int cot = ans[ans.size()-1];if(ans.size()==1){
cnt++;break;}if(cot == maxn){
ans.pop_back();
cnt++;}else{int flag =0,k;for(k = ans.size()-2;k >=0;k--){if(ans[k]+ cot <= maxn){
flag =1;break;}}if(flag ==0){
ans.pop_back();
cnt++;}elseif(flag ==1){
ans.pop_back();
ans.erase(ans.begin()+ k);
cnt++;}}}
cout<<cnt;return0;}
H. P5019 铺设道路(非本人代码)
#include<bits/stdc++.h>#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);#define ms(a,b) memset(a,b,sizeof(a))#define rush() int T;cin>>T;while(T--)#define ll long long//这个是神仙代码........ usingnamespace std;constint N =1e5+100;constint INF =0x3f3f3f3f;intmain(){int n,arr[N],ans =0;
cin>>n;for(int i =1;i <= n;i++)cin>>arr[i];for(int i =2;i <= n;i++)if(arr[i]> arr[i -1])ans += arr[i]- arr[i -1];
cout<<ans + arr[1];}