Submission #501580

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
501580	2022-01-04T06:17:23 Z	tmn2005	Schools (IZhO13_school)	C++17	25 / 100	2000 ms	26132 KB

school

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

#define ar array
#define fr first
#define sc second

#define vec vector
#define ret return

#define ins insert
#define mk make_pair
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front

#define int long long

#define pii pair<int,int>

#define all(s) s.begin(), s.end()
#define allr(s) s.rbegin(), s.rend()

#define NeedForSpeed ios::sync_with_stdio(0),cin.tie(0);
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const int N=1e6+12,INF=1e9,mod = 1e9+7;
bool iswowel(char n){ n = toupper(n); if(n == 'A' || n == 'O' || n == 'U' || n == 'E' || n == 'I') return true; else return false;}
int n,m,k,l,r,o,ans,res,ok,mx,mn = INF;
vec<pair<int, pii>>v;

int get(multiset<pii> &s, multiset<pii> &t, int b, int a){
	int x = 0, y = 0;
	auto it = s.end();
	auto itr = t.end();
	
	while(a--){
		it--;
		x += it->sc;
	}
	while(b--){
		itr--;
		y += itr->fr;
	}
	ret x + y;
}
main(){
	NeedForSpeed
	int x, y;
    cin>>n>>x>>y;    
    for(int i=1; i<=n; i++){
    	cin>>l>>r;
    	v.pb(mk(l-r, mk(l, r)));
	}
	sort(all(v));
	multiset<pii>s, t;
	
	for(int i=0; i<y-1; i++){
		s.ins({v[i].sc.fr, v[i].sc.sc});
	}
	for(int i=y-1; i<n; i++){
		t.ins({v[i].sc.fr, v[i].sc.sc});
	}
	
	
	for(int i=y-1; i<n-x; i++){
		s.ins({v[i].sc.fr, v[i].sc.sc});
		t.erase(t.find({v[i].sc.fr, v[i].sc.sc}));
		
	//for(auto j : s)cout<<j.sc<<" ";cout<<endl;
	//for(auto j : t)cout<<j.fr<<" ";cout<<endl;
	
		//cout<<get(s, t, x, y)<<endl;
		res = max(res, get(s, t, x, y));
	}
	cout<<res<<endl;


	return 0;
}

Compilation message

school.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main(){
      | ^~~~

Subtask #1

25.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Incorrect	0 ms	204 KB	Output isn't correct
5	Incorrect	0 ms	204 KB	Output isn't correct
6	Incorrect	1 ms	204 KB	Output isn't correct
7	Incorrect	42 ms	652 KB	Output isn't correct
8	Correct	2 ms	652 KB	Output is correct
9	Incorrect	14 ms	724 KB	Output isn't correct
10	Incorrect	33 ms	652 KB	Output isn't correct
11	Incorrect	39 ms	728 KB	Output isn't correct
12	Incorrect	46 ms	652 KB	Output isn't correct
13	Incorrect	1841 ms	3396 KB	Output isn't correct
14	Execution timed out	2085 ms	6956 KB	Time limit exceeded
15	Execution timed out	2086 ms	13948 KB	Time limit exceeded
16	Correct	130 ms	15660 KB	Output is correct
17	Execution timed out	2079 ms	19112 KB	Time limit exceeded
18	Execution timed out	2091 ms	20928 KB	Time limit exceeded
19	Execution timed out	2086 ms	22576 KB	Time limit exceeded
20	Execution timed out	2080 ms	26132 KB	Time limit exceeded