维护一个最大堆,最小堆,同时记录一下,相同金额在队列中的个数
#include<iostream>
#include<queue>
#include<cstring>
#include<cstdio>
using namespace std;
int n,k;
int isin[1000010];
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
int x;
while(scanf("%d",&n)!=EOF,n)
{
memset(isin,0,sizeof(isin));
priority_queue<int> pmax;
priority_queue<int,vector<int>,greater<int> > pmin;
long long sum=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&k);
for(int j=1;j<=k;j++)
{
scanf("%d",&x);
isin[x]++;
pmax.push(x);
pmin.push(x);
}
int p,q;
while(!isin[p=pmax.top()])pmax.pop();
while(!isin[q=pmin.top()])pmin.pop();
sum+=p-q;
pmax.pop(),pmin.pop();
isin[p]--,isin[q]--;
}
cout<<sum<<endl;
}
return 0;
}
或者用set,用标准函数max_element和min_element查找最大最小值
#include<iostream>
#include<set>
#include<algorithm>
#include<cstdio>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
#endif
int n;
while(scanf("%d",&n)!=EOF,n)
{
long long sum = 0;
int x,y;
multiset<int> a;
while(n--)
{
int t;
scanf("%d",&t);
while(t--)
{
int temp;
scanf("%d",&temp);
a.insert(temp);
}
int x,y;
multiset<int>::iterator it;
it=a.end();
it--;
x=*it;
a.erase(it);
it=a.begin();
y=*it;
sum+=x-y;
a.erase(it);
}
printf("%lld\n",sum);
}
return 0;
}