oj.uz

답안 #954710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954710 2024-03-28T12:08:00 Z starchan 학교 설립 (IZhO13_school) C++17
5 / 100
 113 ms 15636 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pq priority_queue
#define in pair<int, int>
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define MX (int)3e5+5
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
struct ritul
{
	int Limit;
	int sum;
	pq<int> chungus;
	void init(int x)
	{
		Limit = x;
		while(!chungus.empty())
			chungus.pop();
		sum = 0;
		return;
	}
	void push(int x)
	{
		chungus.push(-x);
		sum+=x;
		if(chungus.size() > Limit)
		{
			sum+=chungus.top();
			chungus.pop();
		}
		return;
	}
	int ans()
	{
		return sum;
	}
};
signed main()
{
	fast(); ritul work;
	int n, A, B; cin >> n >> A >> B;
	vector<int> a(n+1), b(n+1), d(n+1, 0), e(n+1, 0); vector<in> c(n+1);
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i] >> b[i];
		c[i] = {b[i]-a[i], i};
	}
	sort(c.begin(), c.end());
	work.init(A);
	for(int i = 1; i <= n; i++)
	{
		work.push(a[c[i].s]);
		d[i] = work.ans();
	}
	work.init(B);
	for(int i = n; i >= 1; i--)
	{
		work.push(b[c[i].s]);
		e[i] = work.ans();
	}
	int ans = -1;
	for(int i = 0; i < n; i++)
		ans = max(ans, d[i]+e[i+1]);
	cout << ans << "\n";
	return 0;
}

Compilation message

school.cpp: In member function 'void ritul::push(long long int)':
school.cpp:30:21: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   30 |   if(chungus.size() > Limit)
      |      ~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
5.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Incorrect 0 ms 348 KB Output isn't correct
6 Incorrect 0 ms 348 KB Output isn't correct
7 Incorrect 1 ms 604 KB Output isn't correct
8 Incorrect 2 ms 604 KB Output isn't correct
9 Incorrect 2 ms 604 KB Output isn't correct
10 Incorrect 2 ms 604 KB Output isn't correct
11 Incorrect 2 ms 604 KB Output isn't correct
12 Incorrect 2 ms 604 KB Output isn't correct
13 Incorrect 12 ms 2528 KB Output isn't correct
14 Incorrect 24 ms 4444 KB Output isn't correct
15 Correct 51 ms 8276 KB Output is correct
16 Incorrect 55 ms 10968 KB Output isn't correct
17 Incorrect 77 ms 11728 KB Output isn't correct
18 Incorrect 87 ms 12756 KB Output isn't correct
19 Incorrect 95 ms 13780 KB Output isn't correct
20 Incorrect 113 ms 15636 KB Output isn't correct