C：所有数相加%n

S:建立一个string类型的数组，进行排序

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
string s[105];
int n,sum;
signed main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		int x=0;
		cin>>s[i]>>x;
		sum+=x;
		sum%=n;
	}
	sort(s+1,s+n+1);
	cout<<s[sum+1];
	return 0;
}

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int a,b,c,d,e,f,x;
int sum1,sum2;
bool check(int a,int c,int t){
	while(t>(a+c))t-=(a+c);
	if(t>a)return 0;
	else return 1;
}
signed main()
{
	cin>>a>>b>>c>>d>>e>>f>>x;
	for(int i=1;i<=x;i++)
	{
		if(check(a,c,i))
		{
			sum1+=b;
		}
		if(check(d,f,i))
		{
			sum2+=e;
		}
	}
	if(sum1>sum2)
	{
		cout<<"Takahashi";
	}
	else if(sum1<sum2)
	{
		cout<<"Aoki";
	}
	else
	{
		cout<<"Draw";
	}
	return 0;
}

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
struct node{
	int x,y;
};
int n,m,sum;
bool a[1005][1005];
queue<node>q;
void dfs(int x,int y){
	a[x][y]=0;
	for(int i=1;i<=m;i++)if(a[x][i]==1)dfs(x,i);
	for(int i=1;i<=n;i++)if(a[i][y]==1)dfs(i,y);
}
signed main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			char x;
			cin>>x;
			a[i][j]=bool(x-'0');
			if(a[i][j]==1)
			{
				q.push({i,j});
			}
		}
	}
	while(q.size())
	{
		node f=q.front();
		q.pop();
		if(a[f.x][f.y]==1)
		{
			dfs(f.x,f.y);
			sum++;
		}
	}
	cout<<sum;
	return 0;
}

#include<bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
int t;
signed main()
{
	cin>>t;
	while(t--)
	{
		int n,cnt=0;
		map<int,int>mp;
		cin>>n;
		while(n--)
		{
			int x;
			cin>>x;
			mp[x]++;
		}
		while(mp.size())
		{
			cnt++;
			int x=0;
			for(auto xx : mp)
			{
				x=xx.first;
				break;
			}
			mp[x]--;
			if(mp[x]==0)
			{
				mp.erase(x);
			}
			while(1)
			{
				x++;
				if(mp.count(x)==0)break;
				mp[x]--;
				if(mp[x]==0)mp.erase(x);
			}
		}
		cout<<cnt<<endl;
	}
	return 0;
}