답안 #89013

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89013 2018-12-10T08:16:24 Z temoyanteladze 학교 설립 (IZhO13_school) C++14
30 / 100
558 ms 51040 KB

#include <bits/stdc++.h>
#define ll long long
#define x first
#define y second
using namespace std;

int main() {
ll n,l,r;
ll ans=0;
vector<pair<ll,ll> >a;

    cin>>n>>l>>r;
    a.resize(n+1);
	for(ll i=1;i<=n;i++)
		cin>>a[i].x>>a[i].y;

	sort(a.begin()+1,a.end());
	reverse(a.begin()+1,a.end());

	set<ll>q;
    set <pair<ll,ll> > os1,os2;

	for(ll i=1;i<=l;i++)
	{
		ans+=a[i].x;
		q.insert(-a[i].y+a[i].x);
	}

	for(ll i=l+1;i<=n;i++)
	{
		os1.insert(a[i]);
		os2.insert({a[i].y,a[i].x});
	}

	for (ll i=r;i>0;i--){
		pair<ll,ll>fat,sad;
		fat=*os1.rbegin();
	    sad=*os2.rbegin();
	    ll f1=-*q.begin();

		if(f1+fat.x>sad.x)
		{
			ans+=f1+fat.x;
			q.erase(q.begin());
			ll p=fat.y-fat.x;
			q.insert(-p);
			os1.erase(os1.find(fat));
			os2.erase(os2.find({fat.y, fat.x}));

		}
		 else{
			ans +=sad.x;
			os2.erase(os2.find(sad));
			os1.erase(os1.find({sad.y, sad.x}));
		 }
	}
cout<< ans;
	return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Correct 2 ms 624 KB Output is correct
3 Correct 2 ms 624 KB Output is correct
4 Runtime error 3 ms 652 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Correct 2 ms 756 KB Output is correct
6 Correct 2 ms 760 KB Output is correct
7 Incorrect 8 ms 1272 KB Output isn't correct
8 Incorrect 7 ms 1272 KB Output isn't correct
9 Incorrect 6 ms 1272 KB Output isn't correct
10 Correct 7 ms 1272 KB Output is correct
11 Incorrect 9 ms 1328 KB Output isn't correct
12 Incorrect 10 ms 1584 KB Output isn't correct
13 Incorrect 43 ms 2884 KB Output isn't correct
14 Incorrect 189 ms 11076 KB Output isn't correct
15 Correct 318 ms 23236 KB Output is correct
16 Runtime error 507 ms 47564 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Incorrect 379 ms 47564 KB Output isn't correct
18 Incorrect 396 ms 47564 KB Output isn't correct
19 Incorrect 529 ms 47564 KB Output isn't correct
20 Incorrect 558 ms 51040 KB Output isn't correct