2022/4/13 天梯赛刷题记录

L2-015 互评成绩

思路：模拟

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define endl '\n';
typedef long long ll;
typedef pair<int,int> PII;
const int N=1e4+10,mod=1e9+7;
int n,m,k;
priority_queue<double,vector<double>>q;
int main(){
	cin>>n>>k>>m;
	while(n--){
		priority_queue<int,vector<int>>a;
		for(int i=1;i<=k;i++) {
			int x;cin>>x;
			a.push(x);
		}
		a.pop();
		int ans=0;
		while(a.size()>1) {
			ans+=a.top();
			a.pop();
		}
		a.pop();
		q.push(ans*1.0/(k-2));
	}
	vector<double>f;
	for(int i=1;i<=m;i++){
		f.push_back(q.top());
		q.pop();
	}
	for(int i=m-1;i>=1;i--) printf("%.3lf ",f[i]);
	printf("%.3lf",f[0]);
	return 0;
}

L2-017 人以群分

思路:排序

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define endl '\n';
typedef long long ll;
typedef pair<int,int> PII;
const int N=1e5+10,mod=1e9+7;
int n,a[N];
int main(){
	IOS;
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i];
	sort(a+1,a+1+n);
	int ans1=0,ans2=0;
	for(int i=1;i<=n/2;i++) ans2+=a[i];
	for(int i=n;i>=n/2+1;i--) ans1+=a[i];
	int tt1=n/2,tt2=n/2;
    if(n%2) tt1++;
	cout<<"Outgoing #: "<<tt1<<endl;
	cout<<"Introverted #: "<<tt2<<endl;
	cout<<"Diff = "<<abs(ans1-ans2)<<endl; 
	return 0;
}

L2-021 点赞狂魔

思路：排序+set

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define endl '\n';
typedef long long ll;
typedef pair<string,int> PII;
const int N=1e4+10,mod=1e9+7;
struct node{
	string name;
	int num,pos;
}a[N];
bool cmp(node x,node y){
	if(x.num==y.num) return x.pos<y.pos;
	return x.num>y.num;
}
set<int>st;
int n,x,k;
string s;
int main(){
	IOS;
	cin>>n;
	st.clear();
	for(int i=1;i<=n;i++) {
		cin>>a[i].name>>a[i].pos;
		for(int j=1;j<=a[i].pos;j++){
			cin>>x;
			st.insert(x);
		}
		a[i].num=st.size();
		st.clear();
	}
	sort(a+1,a+1+n,cmp);
	for(int i=1;i<=min(3,n);i++){
		if(i<3) cout<<a[i].name<<" ";
		else cout<<a[i].name;
	}
	if(n==1) cout<<"- -";
	if(n==2) cout<<"-";
	return 0;
}