Submission #84463

#	Time	Username	Problem	Language	Result	Execution time	Memory
84463		farukkastamonuda	Schools (IZhO13_school)	C++14	100 / 100	393 ms	31472 KiB

school

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define lo long long 
#define inf 1000000000
#define md 1000000007
#define pb push_back
#define li 300005
#define ii pair<lo int,lo int>
using namespace std;
lo int n,m,ss,cev;
pair<lo int,lo int> A[li];
priority_queue<lo int> q;
multiset< pair<lo int,lo int> > s,t;
int main(){
	scanf("%lld %lld %lld",&n,&m,&ss);
	for(int i=1;i<=n;i++){
		scanf("%lld %lld",&A[i].fi,&A[i].se);
	}
	sort(A+1,A+n+1);
	reverse(A+1,A+n+1);
	for(int i=1;i<=m;i++){
		cev+=A[i].fi;
		q.push(A[i].se-A[i].fi);
	}
	for(int i=m+1;i<=n;i++){
		s.insert(mp(A[i].fi,A[i].se));
		t.insert(mp(A[i].se,A[i].fi));
	}
	while(ss--){
		lo int fark=q.top();
		//q.pop();
		ii a=*s.rbegin();
		ii b=*t.rbegin();
		if(fark+a.fi>b.fi){
			cev+=fark+a.fi;
			q.pop();
			s.erase(s.find(a));
			t.erase(t.find(mp(a.se,a.fi)));
			q.push(a.se-a.fi);
		}
		else{
			cev+=b.fi;
			t.erase(t.find(b));
			s.erase(s.find(mp(b.se,b.fi)));
		}
	}
	printf("%lld\n",cev);
	return 0;
}

Compilation message (stderr)

school.cpp: In function 'int main()':
school.cpp:17:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld",&n,&m,&ss);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
school.cpp:19:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld",&A[i].fi,&A[i].se);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 100 / 100