Submission #502522

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
502522	2022-01-06T07:57:17 Z	ismoilov	Schools (IZhO13_school)	C++14	30 / 100	191 ms	13860 KB

school

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
typedef long long ll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).rbegin(), (x).rend()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
const int maxx = 3e5+5;
int a[maxx], b[maxx], pr[maxx], rp[maxx];
void S()
{
	int n, ss, m;
	cin >> n >> ss >> m;
	vector <pair<pair<int, int>, int>> c;
	fp(i,0,n){
		cin >> a[i] >> b[i];
		c.push_back({{a[i]-b[i], a[i]}, b[i]});
	}
	sort(all(c));
	multiset <int> sc;
	ll s = 0;
	fpp(i,1,n){
		s += c[i-1].first.second;
		sc.insert(c[i-1].first.second);
		if(sc.size() > ss)
			s -= *sc.begin(), sc.erase(*sc.begin());
		pr[i] = s;
	}
	s = 0;
	sc.clear();
	fm(i,n,0){
		s += c[i-1].second;
		sc.insert(c[i-1].second);
		if(sc.size() > m)
			s -= *sc.begin(), sc.erase(*sc.begin());
		rp[i] = s;
	}
	ll ans = 0;
	fpp(i,0,n){
		ans = max(ans, (ll)(pr[i]+rp[i+1]));
	}
	cout << ans;
}
int main()
{
	IOS;
	S();
}

Compilation message

school.cpp: In function 'void S()':
school.cpp:10:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
      |                           ^
school.cpp:21:2: note: in expansion of macro 'fp'
   21 |  fp(i,0,n){
      |  ^~
school.cpp:11:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
      |                            ^
school.cpp:28:2: note: in expansion of macro 'fpp'
   28 |  fpp(i,1,n){
      |  ^~~
school.cpp:31:16: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |   if(sc.size() > ss)
      |      ~~~~~~~~~~^~~~
school.cpp:12:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   12 | #define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
      |                           ^
school.cpp:37:2: note: in expansion of macro 'fm'
   37 |  fm(i,n,0){
      |  ^~
school.cpp:40:16: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |   if(sc.size() > m)
      |      ~~~~~~~~~~^~~
school.cpp:11:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
      |                            ^
school.cpp:45:2: note: in expansion of macro 'fpp'
   45 |  fpp(i,0,n){
      |  ^~~

Subtask #1

30.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 KB	Output is correct
2	Correct	0 ms	332 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Incorrect	0 ms	332 KB	Output isn't correct
5	Correct	0 ms	332 KB	Output is correct
6	Correct	1 ms	332 KB	Output is correct
7	Incorrect	2 ms	460 KB	Output isn't correct
8	Correct	2 ms	588 KB	Output is correct
9	Incorrect	3 ms	588 KB	Output isn't correct
10	Incorrect	3 ms	588 KB	Output isn't correct
11	Incorrect	2 ms	588 KB	Output isn't correct
12	Incorrect	3 ms	588 KB	Output isn't correct
13	Incorrect	18 ms	2716 KB	Output isn't correct
14	Incorrect	37 ms	3400 KB	Output isn't correct
15	Incorrect	62 ms	4972 KB	Output isn't correct
16	Incorrect	173 ms	12652 KB	Output isn't correct
17	Incorrect	169 ms	11352 KB	Output isn't correct
18	Incorrect	148 ms	11172 KB	Output isn't correct
19	Incorrect	165 ms	12196 KB	Output isn't correct
20	Incorrect	191 ms	13860 KB	Output isn't correct