Time Exceeded
Code
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;
#define endl "\n"
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define fraction() cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
int main()
{
optimize();
int n;
cin >> n;
int ar[n+100];
for(int i = 1; i <= n; i++) cin >> ar[i];
int q;
cin >> q;
while(q--){
int tmp;
cin >> tmp;
int mn = INT_MAX;
int ind;
for(int i = 1; i <= n; i++){
if( ar[i] < mn){
mn = ar[i];
ind = i;
}
}
ar[ind] = tmp;
cout << ind << endl;
}
return 0;
}
Information
- Submit By
- Type
- Submission
- Problem
- P1086 C. KuZ the Position
- Contest
- Bangladesh 2.0
- Language
- C++20 (G++ 13.2.0)
- Submit At
- 2024-08-16 15:45:36
- Judged At
- 2024-11-11 03:17:29
- Judged By
- Score
- 60
- Total Time
- ≥1092ms
- Peak Memory
- ≥1000.0 KiB