oj.uz

Submission #65769

# Submission time Handle Problem Language Result Execution time Memory
65769 2018-08-08T17:50:24 Z naderjemel Sure Bet (CEOI17_sure) C++14
0 / 100
 3 ms 780 KB 
#include <bits/stdc++.h>
using namespace std;
const long long INF=2e9;
int main(){
	int n; scanf("%d",&n);
	vector<long long> as,bs;
	for(int i=0;i<n;i++){
		double a,b; scanf("%lf %lf",&a,&b); a*=10000; b*=10000;
		long long A=a;
		long long B=b;
		as.push_back(A);
		bs.push_back(B);
	}
	sort(as.begin(),as.end());
	sort(bs.begin(),bs.end());
	reverse(as.begin(),as.end());
	reverse(bs.begin(),bs.end());
	int i=0,j=0;
	long long rs=0,us=0;
	long long nowa=0,nowb=0;
	while(i<n || j<n){
		if(nowa<=nowb){
			nowa+=as[i];
			i++; us+=10000;
		}
		else{
			nowb+=bs[j];
			j++; us+=10000;
		}
		rs=max(rs,min(nowa-us,nowb-us));
	}
	printf("%.4lf\n", (double)rs/10000.0);
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:5:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  int n; scanf("%d",&n);
         ~~~~~^~~~~~~~~
sure.cpp:8:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   double a,b; scanf("%lf %lf",&a,&b); a*=10000; b*=10000;
               ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Runtime error 2 ms 780 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Runtime error 2 ms 780 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Runtime error 2 ms 780 KB Execution killed with signal 11 (could be triggered by violating memory limits)