Submission #446141

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
446141	2021-07-21T05:57:41 Z	wind_reaper	Schools (IZhO13_school)	C++17	Compilation error	0 ms	0 KB

school

#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
*/

using namespace std;
// using namespace __gnu_pbds;
using namespace chrono;

// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/

//***************** CONSTANTS *****************



//***************** GLOBAL VARIABLES *****************



//***************** AUXILIARY STRUCTS *****************



//***************** MAIN BODY *****************

void solve(){
	int N, M, S;
	cin >> N >> M >> S;

	vector<array<int64_t, 2>> A(N);
	for(auto& [x, y] : A)
		cin >> x >> y;

	sort(A.begin(), A.end(), [](array<int64_t, 2> a, array<int64_t, 2> b){
		return a[0] - a[1] < b[0] - b[1];
	});

	priority_queue<int64_t> pq;

	int64_t sum = 0;

	for(int i = 0; i < N; i++){
		pq.push(-A[i][1]);
		sum += A[i][1];

		while(pq.size() > S){
			sum += pq.top();
			pq.pop();
		}

		A[i][1] = sum;
	}

	while(!pq.empty()) pq.pop();
	sum = 0;
	int64_t ans = 0;

	for(int i = N - 1; i >= 0; --i){
		pq.push(-A[i][0]);
		sum += A[i][0];

		while(pq.size() > M){
			sum += pq.top();
			pq.pop();
		}

		ans = max(ans, sum + (i ? A[i-1][1] : 0LL));
	}

	cout << ans << '\n';
}

//***************** *****************

int32_t main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);

	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

	int tc = 1;
	// cin >> tc; 
	for (int t = 0; t < tc; t++)
		solve();

	#ifdef LOCAL 
		auto end = high_resolution_clock::now();
		cout << fixed << setprecision(4);
		cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
	#endif

	return 0;
}

/*
If code gives a WA, check for the following : 
1. I/O format

2. Are you clearing all global variables in between tests if multitests are a thing

3. Can you definitively prove the logic
*/

Compilation message

school.cpp: In function 'void solve()':
school.cpp:50:19: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |   while(pq.size() > S){
      |         ~~~~~~~~~~^~~
school.cpp:66:19: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   66 |   while(pq.size() > M){
      |         ~~~~~~~~~~^~~
school.cpp:71:45: error: no matching function for call to 'max(int64_t&, long long int)'
   71 |   ans = max(ans, sum + (i ? A[i-1][1] : 0LL));
      |                                             ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from school.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
school.cpp:71:45: note:   deduced conflicting types for parameter 'const _Tp' ('long int' and 'long long int')
   71 |   ans = max(ans, sum + (i ? A[i-1][1] : 0LL));
      |                                             ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from school.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  300 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
school.cpp:71:45: note:   deduced conflicting types for parameter 'const _Tp' ('long int' and 'long long int')
   71 |   ans = max(ans, sum + (i ? A[i-1][1] : 0LL));
      |                                             ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from school.cpp:1:
/usr/include/c++/10/bits/stl_algo.h:3480:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3480 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3480:5: note:   template argument deduction/substitution failed:
school.cpp:71:45: note:   mismatched types 'std::initializer_list<_Tp>' and 'long int'
   71 |   ans = max(ans, sum + (i ? A[i-1][1] : 0LL));
      |                                             ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from school.cpp:1:
/usr/include/c++/10/bits/stl_algo.h:3486:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3486 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3486:5: note:   template argument deduction/substitution failed:
school.cpp:71:45: note:   mismatched types 'std::initializer_list<_Tp>' and 'long int'
   71 |   ans = max(ans, sum + (i ? A[i-1][1] : 0LL));
      |                                             ^