/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 324.0 KiB
#2 Accepted 16ms 708.0 KiB
#3 Accepted 312ms 792.0 KiB
#4 Accepted 306ms 748.0 KiB
#5 Time Exceeded ≥1107ms ≥956.0 KiB
#6 Time Exceeded ≥1090ms ≥964.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long int 
#define nl "\n"
#define all(x) (x).begin(), (x).end()
#define Yes cout<<"Yes"<<"\n";
#define No  cout<<"No"<<"\n"; 
void run(int t){
    int n, q;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    cin >> q;
    while(q--){
        int X;
        cin >> X;
        int minPos = 0;
        for (int i = 1; i < n; i++) {
            if (a[i] < a[minPos]) {
                minPos = i;
            }
        }
        cout << (minPos + 1) << nl; 
        a[minPos] = X;
    }
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    //cin >> t;
    int c  = 1;
    while(t--){
        //cout << "Case " << c++ << ": ";
        run(t);
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1086 KuZ the Position
Contest
Bangladesh 2.0
Language
C++17 (G++ 13.2.0)
Submit At
2024-08-16 15:42:40
Judged At
2024-10-03 13:30:23
Judged By
Score
60
Total Time
≥1107ms
Peak Memory
≥964.0 KiB