oj.uz

Submission #954709

# Submission time Handle Problem Language Result Execution time Memory
954709 2024-03-28T12:07:22 Z starchan Schools (IZhO13_school) C++17
5 / 100
 108 ms 18640 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 = A; i <= n-B; 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

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 348 KB Output isn't correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Incorrect 2 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 2948 KB Output isn't correct
14 Incorrect 24 ms 5212 KB Output isn't correct
15 Correct 43 ms 9432 KB Output is correct
16 Incorrect 57 ms 12860 KB Output isn't correct
17 Incorrect 85 ms 14324 KB Output isn't correct
18 Incorrect 91 ms 15340 KB Output isn't correct
19 Incorrect 96 ms 16316 KB Output isn't correct
20 Incorrect 108 ms 18640 KB Output isn't correct