#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
struct node
{
int t,n;
}nn;
int T,N,ans;
vector<node> V;
int main()
{
scanf("%d",&T);
while(T--)
{
V.clear();ans=0;
scanf("%d",&N);
while(N--)
{
scanf("%d%d",&nn.t,&nn.n);
bool f=false;
for(int i=0;i<V.size();i++)
{
if(V[i].t==nn.t)
{
f=true;
V[i].n+=nn.n;
break;
}
}
if(!f)
{
V.push_back(nn);
}
}
//cout<<V.size()<<"\n";
//cout<<V[0].t<<" "<<V[0].n<<"\n";
for(int i=0;i<V.size();i++)
{
ans+=V[i].n/64;
if(V[i].n%64)
ans++;
}
if(ans%36)
ans=ans/36+1;
else
ans=ans/36;
printf("%d\n",ans);
}
}
HDU 5463 Clarke and minecraft
最新推荐文章于 2018-11-14 22:36:42 发布