Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
225001 | 章罗睿 | GESP:2023-12月等级4-T2-田忌赛马 | C++ | Wrong Answer | 40 | 1000 MS | 1088 KB | 500 | 2023-12-23 09:18:30 |
#include <bits/stdc++.h> using namespace std; long long u1[1000002],u2[1000002]; int main(){ long long n; cin >> n; for(long long i=1;i<=n;i++) cin >> u1[i]; for(long long i=1;i<=n;i++) cin >> u2[i]; long long sum=0; for(long long i=1;i<=n;i++){ if(u1[i]>u2[i]){ sum++; u1[i]=u1[i-1]; u2[i]=u2[i-1]; } else{ for(long long j=1;j<=n;j++){ if(u1[j]>u2[i]){ sum++; u1[j]=u1[j-1]; u2[i]=u2[i-1]; } } } }cout << sum; }