L2-009 抢红包 (25 分)

简单排序题

#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
using namespace std;
struct node{
	int id;
	double sum=0;
	int num=0;
	bool operator<(const node&t)const{
		return  sum == t.sum ? num==t.num?id < t.id :num>t.num: sum > t.sum;
	}
};

int main(){
	int n;
	cin >> n;
	vector<node> v(n);
	for (int i = 1; i <= n;++i){
		v[i-1].id = i;
		int m;
		cin >> m;
		while(m--){
			int id;
			double k;
			cin >> id >> k;
			v[i-1].sum -= k;
			v[id-1].sum += k;
			v[id-1].num++;
		}
	}
	sort(v.begin(), v.end());
	for(auto [x,y,z]:v){
		cout << x<< " " <<fixed<<setprecision(2)<< y/100.0 << "\n";
	}
}