Submission #341436

#TimeUsernameProblemLanguageResultExecution timeMemory
341436KerimSure Bet (CEOI17_sure)C++17
60 / 100
2043 ms3308 KiB
#include "bits/stdc++.h" #define MAXN 100009 #define INF 1000000007 #define mp(x,y) make_pair(x,y) #define all(v) v.begin(),v.end() #define pb(x) push_back(x) #define wr cout<<"----------------"<<endl; #define ppb() pop_back() #define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++) #define ff first #define ss second #define my_little_dodge 46 #define debug(x) cerr<< #x <<" = "<< x<<endl; using namespace std; typedef long long ll; typedef pair<int,int> PII; template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} double a[2][MAXN];int n; int main(){ //freopen("file.in", "r", stdin); scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%lf%lf",&a[0][i],&a[1][i]); for(int j=0;j<2;j++){ sort(a[j]+1,a[j]+n+1);reverse(a[j]+1,a[j]+n+1); for(int i=1;i<=n;i++)a[j][i]+=a[j][i-1]; }double ans=0; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) umax(ans,min(a[0][i],a[1][j])-i-j); printf("%.4lf\n",ans); return 0; }

Compilation message (stderr)

sure.cpp: In function 'int main()':
sure.cpp:23:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
sure.cpp:25:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |      scanf("%lf%lf",&a[0][i],&a[1][i]);
      |      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...