Submission #682803

# Submission time Handle Problem Language Result Execution time Memory
682803 2023-01-17T03:50:09 Z smartmonky Schools (IZhO13_school) C++14
10 / 100
100 ms 11368 KB
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define int long long
 
using namespace std;
 
const int N = 1e5 + 1;

bool comp(pair <int,int> a, pair <int,int> b){
	return max(a.ff,a.ss) > max(b.ff,b.ss);
}
main(){
	ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, s;
    cin >> n >> m >> s;
    vector <int> a, b;
    vector <pair <int,int> > vp(n);
    for(int i = 0; i < n; i++){
		cin >> vp[i].ff >> vp[i].ss;
		a.pb(vp[i].ff);
		b.pb(vp[i].ss);
	}
	sort(all(vp), comp);
	sort(rall(a));
	sort(rall(b));
	int lm = m, ls = s;
	int ans = 0;
	//swap(s, m);
	for(int i = 0; i < n; i++){
		if(!(vp[i].ff >= a[lm - 1] || vp[i].ss >= b[ls - 1]) || !s && !m)continue;
		if(vp[i].ff >= a[lm - 1] && (m && !s || m && abs(a[lm] - a[lm - 1]) >= abs(b[ls] - b[ls - 1]))){
			ans += vp[i].ff;
			ls++;
			//cout <<"2 " << vp[i].ff << endl;
			m--;
		}else if(vp[i].ss >= b[ls - 1] && (!m || s && abs(a[lm] - a[lm - 1]) <= abs(b[ls] - b[ls - 1]))){
			ans += vp[i].ss;
			lm++;
			s--;
		}
	}
	cout << ans;
}

Compilation message

school.cpp:17:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   17 | main(){
      | ^~~~
school.cpp: In function 'int main()':
school.cpp:36:62: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   36 |   if(!(vp[i].ff >= a[lm - 1] || vp[i].ss >= b[ls - 1]) || !s && !m)continue;
      |                                                           ~~~^~~~~
school.cpp:37:34: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   37 |   if(vp[i].ff >= a[lm - 1] && (m && !s || m && abs(a[lm] - a[lm - 1]) >= abs(b[ls] - b[ls - 1]))){
      |                                ~~^~~~~
school.cpp:42:46: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   42 |   }else if(vp[i].ss >= b[ls - 1] && (!m || s && abs(a[lm] - a[lm - 1]) <= abs(b[ls] - b[ls - 1]))){
      |                                            ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Incorrect 2 ms 468 KB Output isn't correct
8 Incorrect 2 ms 468 KB Output isn't correct
9 Incorrect 2 ms 468 KB Output isn't correct
10 Incorrect 2 ms 468 KB Output isn't correct
11 Incorrect 2 ms 468 KB Output isn't correct
12 Incorrect 3 ms 468 KB Output isn't correct
13 Incorrect 14 ms 1812 KB Output isn't correct
14 Incorrect 33 ms 3200 KB Output isn't correct
15 Incorrect 63 ms 6120 KB Output isn't correct
16 Incorrect 78 ms 6336 KB Output isn't correct
17 Incorrect 74 ms 7344 KB Output isn't correct
18 Incorrect 79 ms 7964 KB Output isn't correct
19 Incorrect 88 ms 8552 KB Output isn't correct
20 Incorrect 100 ms 11368 KB Output isn't correct