Submission #76460024

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ll long long
struct node{ll c,v,f;}a[200005],mx[200005];
bool cmp(node a,node b){return a.v>b.v;}
ll n,k,m,ans;
int main(){
	cin>>n>>k>>m;
	for(ll i=1;i<=n;i++) cin>>a[i].c>>a[i].v,mx[a[i].c].v<a[i].v?mx[a[i].c]={i,a[i].v,0},0:0;
	sort(mx+1,mx+n+1,cmp);
	for(ll i=1;i<=m;i++) ans+=mx[i].v,a[mx[i].c].f=1;
	sort(a+1,a+n+1,cmp);
	for(ll i=1,cnt=1;cnt+m<=k;i++) if(!a[i].f) ans+=a[i].v,cnt++;
	cout<<ans;
}

Submission Info

Submission Time
Task C - Variety
User Rya_
Language C++23 (GCC 15.2.0)
Score 300
Code Size 470 Byte
Status AC
Exec Time 103 ms
Memory 12952 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 23
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
04.txt AC 1 ms 3428 KiB
05.txt AC 90 ms 12860 KiB
06.txt AC 88 ms 12952 KiB
07.txt AC 61 ms 12812 KiB
08.txt AC 1 ms 3612 KiB
09.txt AC 1 ms 3680 KiB
10.txt AC 2 ms 3672 KiB
11.txt AC 41 ms 7236 KiB
12.txt AC 99 ms 12700 KiB
13.txt AC 102 ms 12756 KiB
14.txt AC 102 ms 12740 KiB
15.txt AC 103 ms 12924 KiB
16.txt AC 99 ms 12952 KiB
17.txt AC 99 ms 12876 KiB
18.txt AC 99 ms 12756 KiB
19.txt AC 101 ms 12700 KiB
20.txt AC 100 ms 12884 KiB
21.txt AC 103 ms 12832 KiB
22.txt AC 55 ms 12740 KiB
23.txt AC 103 ms 12812 KiB
sample-01.txt AC 1 ms 3580 KiB
sample-02.txt AC 1 ms 3552 KiB
sample-03.txt AC 1 ms 3416 KiB