C. Multi-Subject Competition

https://codeforc.es/contest/1082/problem/C

题意：给n个人他擅长技能s,程度r；选一个组使得擅长的 技能s的数目一样，且他们组的程度和最大，负数就为0；

思路：每种技能非升序排序，前缀和sum[i]为正的就表示这个技能选i时要选；然后就贡献给一个前缀和是全部技能选i个的程度总和，最后再找最大的；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=998244353;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}

vector<int>v[maxn];
int ans[maxn];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++)
    {
        int s,r;
        cin>>s>>r;
        v[s].pb(r);
    }
    int maxs=0;
    for(int i=1;i<=m;i++)
    {
        int sum=0;
        sort(v[i].begin(),v[i].end());
        reverse(v[i].begin(),v[i].end());
        int si=v[i].size();
        maxs=max(maxs,si);
        for(int j=0;j<v[i].size();j++)
        {
            sum+=v[i][j];
            if(sum>=0)
            {
                ans[j+1]+=sum;
            }
        }
    }
    int Max=0;
    for(int i=1;i<=maxs;i++)
    {
        Max=max(Max,ans[i]);
    }
    cout<<Max<<endl;
	return 0;
}